Base | Representation |
---|---|
bin | 1001001101000100010110… |
… | …0111110000100111000010 |
3 | 1022211110202221021020201000 |
4 | 2103101011213300213002 |
5 | 2311301441404000002 |
6 | 33305040444352430 |
7 | 2063103533115003 |
oct | 223210547604702 |
9 | 38743687236630 |
10 | 10120111000002 |
11 | 3251a07913083 |
12 | 1175418845716 |
13 | 585426338163 |
14 | 26db5d0cb1aa |
15 | 1283a9a2261c |
hex | 934459f09c2 |
10120111000002 has 16 divisors (see below), whose sum is σ = 22489135555680. Its totient is φ = 3373370333316.
The previous prime is 10120110999997. The next prime is 10120111000049. The reversal of 10120111000002 is 20000011102101.
It is a happy number.
It is a super-2 number, since 2×101201110000022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93704731428 + ... + 93704731535.
It is an arithmetic number, because the mean of its divisors is an integer number (1405570972230).
Almost surely, 210120111000002 is an apocalyptic number.
10120111000002 is an abundant number, since it is smaller than the sum of its proper divisors (12369024555678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10120111000002 is a wasteful number, since it uses less digits than its factorization.
10120111000002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187409462974 (or 187409462968 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10120111000002 its reverse (20000011102101), we get a palindrome (30120122102103).
The spelling of 10120111000002 in words is "ten trillion, one hundred twenty billion, one hundred eleven million, two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •