Base | Representation |
---|---|
bin | 1001010010010110111111… |
… | …1000110000001101111101 |
3 | 1100011011102011001222220212 |
4 | 2110211233320300031331 |
5 | 2314244124142124013 |
6 | 33414513020122205 |
7 | 2102502312265154 |
oct | 224455770601575 |
9 | 40134364058825 |
10 | 10211014411133 |
11 | 3287515486338 |
12 | 118ab68096365 |
13 | 590b82379623 |
14 | 274303d9259b |
15 | 12a92a3516a8 |
hex | 9496fe3037d |
10211014411133 has 8 divisors (see below), whose sum is σ = 10273964172000. Its totient is φ = 10148068376208.
The previous prime is 10211014411067. The next prime is 10211014411187. The reversal of 10211014411133 is 33111441011201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10211014411133 - 212 = 10211014407037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10211014411099 and 10211014411108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211014491133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4669943 + ... + 6498491.
It is an arithmetic number, because the mean of its divisors is an integer number (1284245521500).
Almost surely, 210211014411133 is an apocalyptic number.
It is an amenable number.
10211014411133 is a deficient number, since it is larger than the sum of its proper divisors (62949760867).
10211014411133 is a wasteful number, since it uses less digits than its factorization.
10211014411133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1862971.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 10211014411133 its reverse (33111441011201), we get a palindrome (43322455422334).
The spelling of 10211014411133 in words is "ten trillion, two hundred eleven billion, fourteen million, four hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •