Base | Representation |
---|---|
bin | 10001011110100111001… |
… | …001110000110110010000 |
3 | 11020211020201222120211220 |
4 | 101132213021300312100 |
5 | 124134323124330112 |
6 | 2315440002205040 |
7 | 152530245334533 |
oct | 21364711606620 |
9 | 4224221876756 |
10 | 1201100230032 |
11 | 42342484920a |
12 | 174946053780 |
13 | 893565192b1 |
14 | 421c26c6a1a |
15 | 2139b5b998c |
hex | 117a7270d90 |
1201100230032 has 20 divisors (see below), whose sum is σ = 3102842261040. Its totient is φ = 400366743328.
The previous prime is 1201100229983. The next prime is 1201100230069. The reversal of 1201100230032 is 2300320011021.
It is a junction number, because it is equal to n+sod(n) for n = 1201100229993 and 1201100230020.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12511460682 + ... + 12511460777.
It is an arithmetic number, because the mean of its divisors is an integer number (155142113052).
Almost surely, 21201100230032 is an apocalyptic number.
1201100230032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1201100230032 is an abundant number, since it is smaller than the sum of its proper divisors (1901742031008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201100230032 is a wasteful number, since it uses less digits than its factorization.
1201100230032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25022921470 (or 25022921464 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1201100230032 its reverse (2300320011021), we get a palindrome (3501420241053).
The spelling of 1201100230032 in words is "one trillion, two hundred one billion, one hundred million, two hundred thirty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •