Base | Representation |
---|---|
bin | 1010111010101101001010… |
… | …0000100010110001101000 |
3 | 1120111112120102112021212010 |
4 | 2232223102200202301220 |
5 | 3033132004103341212 |
6 | 41310224322515520 |
7 | 2346144066445605 |
oct | 256532240426150 |
9 | 46445512467763 |
10 | 12003670371432 |
11 | 3908800a98223 |
12 | 141a484b05ba0 |
13 | 690c30c3b5bc |
14 | 2d6da32496ac |
15 | 15c39a28303c |
hex | aead2822c68 |
12003670371432 has 64 divisors (see below), whose sum is σ = 31061621145600. Its totient is φ = 3861600822720.
The previous prime is 12003670371419. The next prime is 12003670371457. The reversal of 12003670371432 is 23417307630021.
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 15 ways as a sum of consecutive naturals, for example, 21707832 + ... + 22253927.
It is an arithmetic number, because the mean of its divisors is an integer number (485337830400).
Almost surely, 212003670371432 is an apocalyptic number.
12003670371432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12003670371432 is an abundant number, since it is smaller than the sum of its proper divisors (19057950774168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12003670371432 is a wasteful number, since it uses less digits than its factorization.
12003670371432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43962166 (or 43962162 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 39.
The spelling of 12003670371432 in words is "twelve trillion, three billion, six hundred seventy million, three hundred seventy-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •