Base | Representation |
---|---|
bin | 1001001011111001111000… |
… | …1100100111111000100000 |
3 | 1022202120011212212010021222 |
4 | 2102332132030213320200 |
5 | 2310440022242101422 |
6 | 33251533155434212 |
7 | 2061465305240426 |
oct | 222763614477040 |
9 | 38676155763258 |
10 | 10100122222112 |
11 | 324448a75942a |
12 | 117157a5b5968 |
13 | 58358c08c430 |
14 | 26cbc44c7116 |
15 | 127ad9c71842 |
hex | 92f9e327e20 |
10100122222112 has 48 divisors (see below), whose sum is σ = 21414511926360. Its totient is φ = 4661527283712.
The previous prime is 10100122222111. The next prime is 10100122222159. The reversal of 10100122222112 is 21122222100101.
10100122222112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 5009521334416 + 5090600887696 = 2238196^2 + 2256236^2 .
It is not an unprimeable number, because it can be changed into a prime (10100122222111) 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, 39038714 + ... + 39296582.
Almost surely, 210100122222112 is an apocalyptic number.
It is an amenable number.
10100122222112 is an abundant number, since it is smaller than the sum of its proper divisors (11314389704248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100122222112 is a wasteful number, since it uses less digits than its factorization.
10100122222112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 352045 (or 352037 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10100122222112 its reverse (21122222100101), we get a palindrome (31222344322213).
The spelling of 10100122222112 in words is "ten trillion, one hundred billion, one hundred twenty-two million, two hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •