Base | Representation |
---|---|
bin | 11011010010101100100001… |
… | …011001010011100101000000 |
3 | 120201222221121020200201122212 |
4 | 123102230201121103211000 |
5 | 111213101024343200412 |
6 | 1103141540022121252 |
7 | 34166012064602630 |
oct | 3322544131234500 |
9 | 521887536621585 |
10 | 120032011303232 |
11 | 35278321175116 |
12 | 11567011880228 |
13 | 51c8c7c3c5c12 |
14 | 218d81a6766c0 |
15 | dd2494b26222 |
hex | 6d2b21653940 |
120032011303232 has 28 divisors (see below), whose sum is σ = 272215454206560. Its totient is φ = 51442290558336.
The previous prime is 120032011303213. The next prime is 120032011303249. The reversal of 120032011303232 is 232303110230021.
It is a tau number, because it is divible by the number of its divisors (28).
It is a super-2 number, since 2×1200320113032322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120032011303198 and 120032011303207.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 133964297882 + ... + 133964298777.
Almost surely, 2120032011303232 is an apocalyptic number.
It is an amenable number.
120032011303232 is an abundant number, since it is smaller than the sum of its proper divisors (152183442903328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120032011303232 is an equidigital number, since it uses as much as digits as its factorization.
120032011303232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 267928596678 (or 267928596668 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 120032011303232 its reverse (232303110230021), we get a palindrome (352335121533253).
The spelling of 120032011303232 in words is "one hundred twenty trillion, thirty-two billion, eleven million, three hundred three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •