Base | Representation |
---|---|
bin | 1100110000001001000100… |
… | …1111111000010011010000 |
3 | 1211122102012020111100021212 |
4 | 3030002101033320103100 |
5 | 3314210414242110412 |
6 | 45453131025235252 |
7 | 2644666441343300 |
oct | 314022117702320 |
9 | 54572166440255 |
10 | 14021210113232 |
11 | 45163a8638693 |
12 | 16a54a2a92b28 |
13 | 7a926b2542ca |
14 | 3668b7357600 |
15 | 194acd001222 |
hex | cc0913f84d0 |
14021210113232 has 30 divisors (see below), whose sum is σ = 31601375346258. Its totient is φ = 6009090048192.
The previous prime is 14021210113223. The next prime is 14021210113243. The reversal of 14021210113232 is 23231101212041.
It can be written as a sum of positive squares in only one way, i.e., 13110743007376 + 910467105856 = 3620876^2 + 954184^2 .
It is a super-2 number, since 2×140212101132322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14021210113198 and 14021210113207.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8942097503 + ... + 8942099070.
Almost surely, 214021210113232 is an apocalyptic number.
It is an amenable number.
14021210113232 is an abundant number, since it is smaller than the sum of its proper divisors (17580165233026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14021210113232 is a wasteful number, since it uses less digits than its factorization.
14021210113232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17884196595 (or 17884196582 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 14021210113232 its reverse (23231101212041), we get a palindrome (37252311325273).
The spelling of 14021210113232 in words is "fourteen trillion, twenty-one billion, two hundred ten million, one hundred thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •