Base | Representation |
---|---|
bin | 11110101001010001… |
… | …11011010011001011 |
3 | 1120110121002112101102 |
4 | 33110220323103023 |
5 | 232143303302311 |
6 | 11320320012015 |
7 | 1121464044503 |
oct | 172450732313 |
9 | 46417075342 |
10 | 16452400331 |
11 | 6a82a50974 |
12 | 3231a6100b |
13 | 1722713633 |
14 | b21096a03 |
15 | 6645aa43b |
hex | 3d4a3b4cb |
16452400331 has 8 divisors (see below), whose sum is σ = 16680041040. Its totient is φ = 16224820992.
The previous prime is 16452400313. The next prime is 16452400343. The reversal of 16452400331 is 13300425461.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16452400331 - 226 = 16385291467 is a prime.
It is a super-2 number, since 2×164524003312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16452400294 and 16452400303.
It is not an unprimeable number, because it can be changed into a prime (16452400351) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 890435 + ... + 908723.
It is an arithmetic number, because the mean of its divisors is an integer number (2085005130).
Almost surely, 216452400331 is an apocalyptic number.
16452400331 is a deficient number, since it is larger than the sum of its proper divisors (227640709).
16452400331 is a wasteful number, since it uses less digits than its factorization.
16452400331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30685.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 16452400331 its reverse (13300425461), we get a palindrome (29752825792).
The spelling of 16452400331 in words is "sixteen billion, four hundred fifty-two million, four hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •