Base | Representation |
---|---|
bin | 1001001100011111000011… |
… | …1010110111100000000100 |
3 | 1022210111221020211022112000 |
4 | 2103013300322313200010 |
5 | 2311120441100323022 |
6 | 33300303230225300 |
7 | 2062300463114121 |
oct | 223076072674004 |
9 | 38714836738460 |
10 | 10110100011012 |
11 | 324873a982961 |
12 | 11734a4055230 |
13 | 5844bc2a0c31 |
14 | 26d48d707748 |
15 | 127ec0be36ac |
hex | 931f0eb7804 |
10110100011012 has 24 divisors (see below), whose sum is σ = 26211370399200. Its totient is φ = 3370033336968.
The previous prime is 10110100010987. The next prime is 10110100011049. The reversal of 10110100011012 is 21011000101101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10110100010985 and 10110100011003.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46806018462 + ... + 46806018677.
It is an arithmetic number, because the mean of its divisors is an integer number (1092140433300).
Almost surely, 210110100011012 is an apocalyptic number.
10110100011012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10110100011012 is an abundant number, since it is smaller than the sum of its proper divisors (16101270388188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110100011012 is a wasteful number, since it uses less digits than its factorization.
10110100011012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93612037152 (or 93612037144 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10110100011012 its reverse (21011000101101), we get a palindrome (31121100112113).
The spelling of 10110100011012 in words is "ten trillion, one hundred ten billion, one hundred million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •