Base | Representation |
---|---|
bin | 1001001011111101100001… |
… | …1110100011001100001100 |
3 | 1022202122201000201101102021 |
4 | 2102333120132203030030 |
5 | 2310444023100000022 |
6 | 33252214204535524 |
7 | 2061531450226030 |
oct | 222773036431414 |
9 | 38678630641367 |
10 | 10101100000012 |
11 | 324494168443a |
12 | 11717b1b515a4 |
13 | 5836b6818938 |
14 | 26cc782cc1c0 |
15 | 127b45a137c7 |
hex | 92fd87a330c |
10101100000012 has 12 divisors (see below), whose sum is σ = 20202200000080. Its totient is φ = 4329042857136.
The previous prime is 10101100000007. The next prime is 10101100000027. The reversal of 10101100000012 is 21000000110101.
10101100000012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
10101100000012 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 10101099999950 and 10101100000004.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 180376785687 + ... + 180376785742.
Almost surely, 210101100000012 is an apocalyptic number.
It is an amenable number.
10101100000012 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101100000012 is a wasteful number, since it uses less digits than its factorization.
10101100000012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 360753571440 (or 360753571438 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 10101100000012 its reverse (21000000110101), we get a palindrome (31101100110113).
The spelling of 10101100000012 in words is "ten trillion, one hundred one billion, one hundred million, twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •