Base | Representation |
---|---|
bin | 10001111010101001010… |
… | …000000101000001011000 |
3 | 11100200221110102001101000 |
4 | 101322221100011001120 |
5 | 130132444223223112 |
6 | 2341334445225000 |
7 | 154644201056301 |
oct | 21725120050130 |
9 | 4320843361330 |
10 | 1231200211032 |
11 | 435170470470 |
12 | 17a746562160 |
13 | 8c14251933c |
14 | 4383a1197a8 |
15 | 2205dd927dc |
hex | 11ea9405058 |
1231200211032 has 64 divisors (see below), whose sum is σ = 3730909737600. Its totient is φ = 373090972320.
The previous prime is 1231200211019. The next prime is 1231200211079. The reversal of 1231200211032 is 2301120021321.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1231200210996 and 1231200211014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 259088578 + ... + 259093329.
It is an arithmetic number, because the mean of its divisors is an integer number (58295464650).
Almost surely, 21231200211032 is an apocalyptic number.
1231200211032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1231200211032 is an abundant number, since it is smaller than the sum of its proper divisors (2499709526568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1231200211032 is a wasteful number, since it uses less digits than its factorization.
1231200211032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 518181933 (or 518181923 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1231200211032 its reverse (2301120021321), we get a palindrome (3532320232353).
The spelling of 1231200211032 in words is "one trillion, two hundred thirty-one billion, two hundred million, two hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •