Base | Representation |
---|---|
bin | 1001000111010111101001… |
… | …0100111100011000010001 |
3 | 1022111010002010011120111122 |
4 | 2101311322110330120101 |
5 | 2303200442004341423 |
6 | 33152050140052025 |
7 | 2053036506003536 |
oct | 221657224743021 |
9 | 38433063146448 |
10 | 10022211012113 |
11 | 3214439924183 |
12 | 115a456234015 |
13 | 57912391bc41 |
14 | 269112d1ad8d |
15 | 125a79d538c8 |
hex | 91d7a53c611 |
10022211012113 has 8 divisors (see below), whose sum is σ = 10346355760896. Its totient is φ = 9698119239600.
The previous prime is 10022211012103. The next prime is 10022211012139. The reversal of 10022211012113 is 31121011222001.
It is a happy number.
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 10022211012113 - 216 = 10022210946577 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10022211012091 and 10022211012100.
It is not an unprimeable number, because it can be changed into a prime (10022211012103) 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, 12859406 + ... + 13616487.
It is an arithmetic number, because the mean of its divisors is an integer number (1293294470112).
Almost surely, 210022211012113 is an apocalyptic number.
It is an amenable number.
10022211012113 is a deficient number, since it is larger than the sum of its proper divisors (324144748783).
10022211012113 is a wasteful number, since it uses less digits than its factorization.
10022211012113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26488135.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 10022211012113 its reverse (31121011222001), we get a palindrome (41143222234114).
The spelling of 10022211012113 in words is "ten trillion, twenty-two billion, two hundred eleven million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •