Base | Representation |
---|---|
bin | 110100101000111110001110… |
… | …000010111110110010100000 |
3 | 1010100201112010002102000220222 |
4 | 310220332032002332302200 |
5 | 220321111140324134212 |
6 | 2140220022112422212 |
7 | 66523222605524066 |
oct | 6450761602766240 |
9 | 1110645102360828 |
10 | 231514005302432 |
11 | 678495a14877a6 |
12 | 21b70b6bb47968 |
13 | 9c248a555bc18 |
14 | 41254a26d4036 |
15 | 1bb7325a41c72 |
hex | d28f8e0beca0 |
231514005302432 has 48 divisors (see below), whose sum is σ = 460224919103040. Its totient is φ = 114631518131712.
The previous prime is 231514005302401. The next prime is 231514005302441. The reversal of 231514005302432 is 234203500415132.
It is a super-2 number, since 2×2315140053024322 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 231514005302392 and 231514005302401.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 250440044 + ... + 251362772.
It is an arithmetic number, because the mean of its divisors is an integer number (9588019147980).
Almost surely, 2231514005302432 is an apocalyptic number.
It is an amenable number.
231514005302432 is a deficient number, since it is larger than the sum of its proper divisors (228710913800608).
231514005302432 is a wasteful number, since it uses less digits than its factorization.
231514005302432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 998965 (or 998957 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 35.
Adding to 231514005302432 its reverse (234203500415132), we get a palindrome (465717505717564).
The spelling of 231514005302432 in words is "two hundred thirty-one trillion, five hundred fourteen billion, five million, three hundred two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •