Base | Representation |
---|---|
bin | 1001001001101110100110… |
… | …01011000011110010011101 |
3 | 2122020222100020101021211200 |
4 | 10210313103023003302131 |
5 | 10114213422424022222 |
6 | 110445302201310113 |
7 | 4145005530113544 |
oct | 444672313036235 |
9 | 78228306337750 |
10 | 20125464673437 |
11 | 645a1861581a2 |
12 | 2310549495339 |
13 | b2ca91693486 |
14 | 4d811326315b |
15 | 24d79997deac |
hex | 124dd32c3c9d |
20125464673437 has 12 divisors (see below), whose sum is σ = 29136334587360. Its totient is φ = 13386413857608.
The previous prime is 20125464673423. The next prime is 20125464673459. The reversal of 20125464673437 is 73437646452102.
20125464673437 is a `hidden beast` number, since 2 + 0 + 1 + 2 + 546 + 4 + 67 + 3 + 4 + 37 = 666.
It is not a de Polignac number, because 20125464673437 - 210 = 20125464672413 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20125466673437) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 2546878443 + ... + 2546886344.
It is an arithmetic number, because the mean of its divisors is an integer number (2428027882280).
Almost surely, 220125464673437 is an apocalyptic number.
It is an amenable number.
20125464673437 is a deficient number, since it is larger than the sum of its proper divisors (9010869913923).
20125464673437 is a wasteful number, since it uses less digits than its factorization.
20125464673437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5093765232 (or 5093765229 counting only the distinct ones).
The product of its (nonzero) digits is 20321280, while the sum is 54.
The spelling of 20125464673437 in words is "twenty trillion, one hundred twenty-five billion, four hundred sixty-four million, six hundred seventy-three thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •