Base | Representation |
---|---|
bin | 1001001100011111000011… |
… | …1111000110101111010000 |
3 | 1022210111221022220202111201 |
4 | 2103013300333012233100 |
5 | 2311120441341401000 |
6 | 33300303310120544 |
7 | 2062300505422135 |
oct | 223076077065720 |
9 | 38714838822451 |
10 | 10110101122000 |
11 | 3248740571630 |
12 | 11734a44b0154 |
13 | 5844bc59c819 |
14 | 26d48d91658c |
15 | 127ec0d6296a |
hex | 931f0fc6bd0 |
10110101122000 has 160 divisors (see below), whose sum is σ = 27828114672384. Its totient is φ = 3516556736000.
The previous prime is 10110101121971. The next prime is 10110101122003. The reversal of 10110101122000 is 22110101101.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110101122003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9484219 + ... + 10496218.
Almost surely, 210110101122000 is an apocalyptic number.
10110101122000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10110101122000 is an abundant number, since it is smaller than the sum of its proper divisors (17718013550384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110101122000 is a wasteful number, since it uses less digits than its factorization.
10110101122000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19980494 (or 19980478 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10110101122000 its reverse (22110101101), we get a palindrome (10132211223101).
The spelling of 10110101122000 in words is "ten trillion, one hundred ten billion, one hundred one million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •