Base | Representation |
---|---|
bin | 10010110100101000… |
… | …110011011111010101 |
3 | 1221011111112222120120 |
4 | 102310220303133111 |
5 | 312342334332400 |
6 | 13141244222153 |
7 | 1313556054453 |
oct | 226450633725 |
9 | 57144488516 |
10 | 20210464725 |
11 | 863130a310 |
12 | 3b0053a959 |
13 | 1ba1187189 |
14 | d9a22d9d3 |
15 | 7d4490ca0 |
hex | 4b4a337d5 |
20210464725 has 96 divisors (see below), whose sum is σ = 38085562368. Its totient is φ = 9367680000.
The previous prime is 20210464721. The next prime is 20210464741. The reversal of 20210464725 is 52746401202.
It is not a de Polignac number, because 20210464725 - 22 = 20210464721 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20210464721) 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 95 ways as a sum of consecutive naturals, for example, 2117965 + ... + 2127485.
It is an arithmetic number, because the mean of its divisors is an integer number (396724608).
Almost surely, 220210464725 is an apocalyptic number.
20210464725 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
20210464725 is a deficient number, since it is larger than the sum of its proper divisors (17875097643).
20210464725 is a wasteful number, since it uses less digits than its factorization.
20210464725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9659 (or 9654 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 33.
Adding to 20210464725 its reverse (52746401202), we get a palindrome (72956865927).
The spelling of 20210464725 in words is "twenty billion, two hundred ten million, four hundred sixty-four thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •