Base | Representation |
---|---|
bin | 1001001001101110110110… |
… | …10001101000111111110001 |
3 | 2122020222200201011220120110 |
4 | 10210313123101220333301 |
5 | 10114214212224211213 |
6 | 110445323455131533 |
7 | 4145012100446034 |
oct | 444673321507761 |
9 | 78228621156513 |
10 | 20125600616433 |
11 | 645a245969184 |
12 | 2310586b13ba9 |
13 | b2cab38b0010 |
14 | 4d812732d01b |
15 | 24d7a68835c3 |
hex | 124ddb468ff1 |
20125600616433 has 16 divisors (see below), whose sum is σ = 30419261391680. Its totient is φ = 11733143678784.
The previous prime is 20125600616419. The next prime is 20125600616453. The reversal of 20125600616433 is 33461600652102.
It is not a de Polignac number, because 20125600616433 - 26 = 20125600616369 is a prime.
It is a super-3 number, since 3×201256006164333 (a number of 41 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20125600616391 and 20125600616400.
It is not an unprimeable number, because it can be changed into a prime (20125600616453) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13580026666 + ... + 13580028147.
It is an arithmetic number, because the mean of its divisors is an integer number (1901203836980).
Almost surely, 220125600616433 is an apocalyptic number.
It is an amenable number.
20125600616433 is a deficient number, since it is larger than the sum of its proper divisors (10293660775247).
20125600616433 is a wasteful number, since it uses less digits than its factorization.
20125600616433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27160054848.
The product of its (nonzero) digits is 155520, while the sum is 39.
The spelling of 20125600616433 in words is "twenty trillion, one hundred twenty-five billion, six hundred million, six hundred sixteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •