Base | Representation |
---|---|
bin | 1001001100011111000100… |
… | …0010111010101011110000 |
3 | 1022210111221101210112011010 |
4 | 2103013301002322223300 |
5 | 2311120442120334300 |
6 | 33300303343350520 |
7 | 2062300520053224 |
oct | 223076102725360 |
9 | 38714841715133 |
10 | 10110102121200 |
11 | 3248741094314 |
12 | 11734a48b2440 |
13 | 5844bc85c573 |
14 | 26d48dad6784 |
15 | 127ec0eada50 |
hex | 931f10baaf0 |
10110102121200 has 120 divisors (see below), whose sum is σ = 32386742123776. Its totient is φ = 2695967712000.
The previous prime is 10110102121193. The next prime is 10110102121201. The reversal of 10110102121200 is 212120101101.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110102121201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 93583215 + ... + 93691185.
Almost surely, 210110102121200 is an apocalyptic number.
10110102121200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10110102121200 is an abundant number, since it is smaller than the sum of its proper divisors (22276640002576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110102121200 is a wasteful number, since it uses less digits than its factorization.
10110102121200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186023 (or 186012 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10110102121200 its reverse (212120101101), we get a palindrome (10322222222301).
The spelling of 10110102121200 in words is "ten trillion, one hundred ten billion, one hundred two million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •