Base | Representation |
---|---|
bin | 1001010010011100010011… |
… | …1001010001010100000011 |
3 | 1100011022002112201102001000 |
4 | 2110213010321101110003 |
5 | 2314310034244010201 |
6 | 33415310324343043 |
7 | 2102552540625411 |
oct | 224470471212403 |
9 | 40138075642030 |
10 | 10212440610051 |
11 | 3288087539729 |
12 | 118b2a5844a83 |
13 | 59104b99bc04 |
14 | 2743db5642b1 |
15 | 12a9b066dd86 |
hex | 949c4e51503 |
10212440610051 has 16 divisors (see below), whose sum is σ = 15131632516000. Its totient is φ = 6807352847904.
The previous prime is 10212440609999. The next prime is 10212440610059. The reversal of 10212440610051 is 15001604421201.
10212440610051 is a `hidden beast` number, since 1 + 0 + 2 + 1 + 2 + 4 + 40 + 610 + 0 + 5 + 1 = 666.
It is not a de Polignac number, because 10212440610051 - 225 = 10212407055619 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10212440609997 and 10212440610024.
It is not an unprimeable number, because it can be changed into a prime (10212440610059) 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, 25936876 + ... + 26327673.
It is an arithmetic number, because the mean of its divisors is an integer number (945727032250).
Almost surely, 210212440610051 is an apocalyptic number.
10212440610051 is a deficient number, since it is larger than the sum of its proper divisors (4919191905949).
10212440610051 is an equidigital number, since it uses as much as digits as its factorization.
10212440610051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52271795 (or 52271789 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The spelling of 10212440610051 in words is "ten trillion, two hundred twelve billion, four hundred forty million, six hundred ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •