Base | Representation |
---|---|
bin | 10100110100110000000… |
… | …111110000110000001000 |
3 | 12001210202001010211010020 |
4 | 110310300013300300020 |
5 | 141421223022410012 |
6 | 3013223510220440 |
7 | 205250202426420 |
oct | 24646007606010 |
9 | 5053661124106 |
10 | 1431031450632 |
11 | 501995a46463 |
12 | 1b1415654720 |
13 | a4c3a89b494 |
14 | 4d395a2b480 |
15 | 273575cda8c |
hex | 14d301f0c08 |
1431031450632 has 64 divisors (see below), whose sum is σ = 4092979230720. Its totient is φ = 408434334528.
The previous prime is 1431031450609. The next prime is 1431031450669. The reversal of 1431031450632 is 2360541301341.
It is a junction number, because it is equal to n+sod(n) for n = 1431031450593 and 1431031450602.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4338288 + ... + 4656479.
It is an arithmetic number, because the mean of its divisors is an integer number (63952800480).
Almost surely, 21431031450632 is an apocalyptic number.
1431031450632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1431031450632 is an abundant number, since it is smaller than the sum of its proper divisors (2661947780088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1431031450632 is a wasteful number, since it uses less digits than its factorization.
1431031450632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8995730 (or 8995726 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 33.
Adding to 1431031450632 its reverse (2360541301341), we get a palindrome (3791572751973).
The spelling of 1431031450632 in words is "one trillion, four hundred thirty-one billion, thirty-one million, four hundred fifty thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •