Base | Representation |
---|---|
bin | 1001010010011011000011… |
… | …1001011111111011101011 |
3 | 1100011021020011110000220101 |
4 | 2110212300321133323223 |
5 | 2314303342403004421 |
6 | 33415213142010231 |
7 | 2102541325225564 |
oct | 224466071377353 |
9 | 40137204400811 |
10 | 10212105125611 |
11 | 3287a25129264 |
12 | 118b211416977 |
13 | 590cc73289cc |
14 | 2743a8b9516b |
15 | 12a990ea1191 |
hex | 949b0e5feeb |
10212105125611 has 4 divisors (see below), whose sum is σ = 10461180860424. Its totient is φ = 9963029390800.
The previous prime is 10212105125569. The next prime is 10212105125647. The reversal of 10212105125611 is 11652150121201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10212105125611 - 27 = 10212105125483 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10212105125611.
It is not an unprimeable number, because it can be changed into a prime (10212105125671) 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, 124537867345 + ... + 124537867426.
It is an arithmetic number, because the mean of its divisors is an integer number (2615295215106).
Almost surely, 210212105125611 is an apocalyptic number.
10212105125611 is a deficient number, since it is larger than the sum of its proper divisors (249075734813).
10212105125611 is an equidigital number, since it uses as much as digits as its factorization.
10212105125611 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 249075734812.
The product of its (nonzero) digits is 1200, while the sum is 28.
Adding to 10212105125611 its reverse (11652150121201), we get a palindrome (21864255246812).
The spelling of 10212105125611 in words is "ten trillion, two hundred twelve billion, one hundred five million, one hundred twenty-five thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •