Base | Representation |
---|---|
bin | 1110111101101001011000… |
… | …0100101011011001101111 |
3 | 2011020211010001220210221201 |
4 | 3233122112010223121233 |
5 | 4124023143043134211 |
6 | 54554020023310331 |
7 | 3315430623210130 |
oct | 357322604533157 |
9 | 64224101823851 |
10 | 16452242552431 |
11 | 52733a2014734 |
12 | 1a1867a8ab3a7 |
13 | 92459437626a |
14 | 40c4155a7c87 |
15 | 1d7e61e8e0c1 |
hex | ef69612b66f |
16452242552431 has 8 divisors (see below), whose sum is σ = 19239831822464. Its totient is φ = 13773970508760.
The previous prime is 16452242552423. The next prime is 16452242552491. The reversal of 16452242552431 is 13425524225461.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16452242552431 - 23 = 16452242552423 is a prime.
It is a super-2 number, since 2×164522425524312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16452242552491) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27329306265 + ... + 27329306866.
It is an arithmetic number, because the mean of its divisors is an integer number (2404978977808).
Almost surely, 216452242552431 is an apocalyptic number.
16452242552431 is a deficient number, since it is larger than the sum of its proper divisors (2787589270033).
16452242552431 is an equidigital number, since it uses as much as digits as its factorization.
16452242552431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54658613181.
The product of its digits is 2304000, while the sum is 46.
Adding to 16452242552431 its reverse (13425524225461), we get a palindrome (29877766777892).
The spelling of 16452242552431 in words is "sixteen trillion, four hundred fifty-two billion, two hundred forty-two million, five hundred fifty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •