Base | Representation |
---|---|
bin | 1100101110111110100010… |
… | …0100100101101010100000 |
3 | 1211120111112201112200200112 |
4 | 3023233220210211222200 |
5 | 3313343424240320412 |
6 | 45440021310110452 |
7 | 2643360540053153 |
oct | 313575044455240 |
9 | 54514481480615 |
10 | 14001200323232 |
11 | 450896a632261 |
12 | 16a16397ab428 |
13 | 7a73cc82c595 |
14 | 365939a43c9a |
15 | 19430b49e722 |
hex | cbbe8925aa0 |
14001200323232 has 12 divisors (see below), whose sum is σ = 27564863136426. Its totient is φ = 7000600161600.
The previous prime is 14001200323217. The next prime is 14001200323247. The reversal of 14001200323232 is 23232300210041.
It is an interprime number because it is at equal distance from previous prime (14001200323217) and next prime (14001200323247).
It can be written as a sum of positive squares in only one way, i.e., 12769730722576 + 1231469600656 = 3573476^2 + 1109716^2 .
It is a super-2 number, since 2×140012003232322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14001200323198 and 14001200323207.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 218768755019 + ... + 218768755082.
Almost surely, 214001200323232 is an apocalyptic number.
It is an amenable number.
14001200323232 is a deficient number, since it is larger than the sum of its proper divisors (13563662813194).
14001200323232 is an equidigital number, since it uses as much as digits as its factorization.
14001200323232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 437537510111 (or 437537510103 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 14001200323232 its reverse (23232300210041), we get a palindrome (37233500533273).
The spelling of 14001200323232 in words is "fourteen trillion, one billion, two hundred million, three hundred twenty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •