Base | Representation |
---|---|
bin | 10110111101111010111101… |
… | …100111011100011010000001 |
3 | 111020122200012102210000120122 |
4 | 112331322331213130122001 |
5 | 101214441012324213441 |
6 | 554500212455150025 |
7 | 30163615013062202 |
oct | 2675727547343201 |
9 | 436580172700518 |
10 | 101012222101121 |
11 | 2a205051aa1591 |
12 | b3b4a18975315 |
13 | 444954759b186 |
14 | 1ad303656d5a9 |
15 | ba285e02934b |
hex | 5bdebd9dc681 |
101012222101121 has 64 divisors (see below), whose sum is σ = 113426401075200. Its totient is φ = 89461033998336.
The previous prime is 101012222101057. The next prime is 101012222101151. The reversal of 101012222101121 is 121101222210101.
It is not a de Polignac number, because 101012222101121 - 26 = 101012222101057 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 101012222101121.
It is not an unprimeable number, because it can be changed into a prime (101012222101151) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11964015926 + ... + 11964024368.
It is an arithmetic number, because the mean of its divisors is an integer number (1772287516800).
Almost surely, 2101012222101121 is an apocalyptic number.
It is an amenable number.
101012222101121 is a deficient number, since it is larger than the sum of its proper divisors (12414178974079).
101012222101121 is a wasteful number, since it uses less digits than its factorization.
101012222101121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9918.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 101012222101121 its reverse (121101222210101), we get a palindrome (222113444311222).
The spelling of 101012222101121 in words is "one hundred one trillion, twelve billion, two hundred twenty-two million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •