Base | Representation |
---|---|
bin | 1001001010110011110110… |
… | …10010111111001100111000 |
3 | 2122101112022101211202012211 |
4 | 10211121323102333030320 |
5 | 10120321044113444311 |
6 | 110514331414144504 |
7 | 4150463066160301 |
oct | 445317322771470 |
9 | 78345271752184 |
10 | 20162645062456 |
11 | 6473a25553826 |
12 | 23177a5052134 |
13 | b33438540470 |
14 | 4d9c3d1837a8 |
15 | 24e723b55821 |
hex | 12567b4bf338 |
20162645062456 has 16 divisors (see below), whose sum is σ = 40713033299400. Its totient is φ = 9305836182624.
The previous prime is 20162645062451. The next prime is 20162645062477. The reversal of 20162645062456 is 65426054626102.
It is a happy number.
It is a super-2 number, since 2×201626450624562 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20162645062451) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 96935793466 + ... + 96935793673.
Almost surely, 220162645062456 is an apocalyptic number.
20162645062456 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
20162645062456 is an abundant number, since it is smaller than the sum of its proper divisors (20550388236944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20162645062456 is a wasteful number, since it uses less digits than its factorization.
20162645062456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193871587158 (or 193871587154 counting only the distinct ones).
The product of its (nonzero) digits is 4147200, while the sum is 49.
Adding to 20162645062456 its reverse (65426054626102), we get a palindrome (85588699688558).
The spelling of 20162645062456 in words is "twenty trillion, one hundred sixty-two billion, six hundred forty-five million, sixty-two thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •