Base | Representation |
---|---|
bin | 10110111111010111111001… |
… | …100100100000001100111000 |
3 | 111021000012202222110211201011 |
4 | 112333113321210200030320 |
5 | 101223104400111223000 |
6 | 555014114523403304 |
7 | 30204046631032150 |
oct | 2677277144401470 |
9 | 437005688424634 |
10 | 101112012211000 |
11 | 2a2433aa9aa07a |
12 | b410228383534 |
13 | 4455a8b76ca7b |
14 | 1ad7bc1795760 |
15 | ba524eb042ba |
hex | 5bf5f9920338 |
101112012211000 has 64 divisors (see below), whose sum is σ = 270402409817280. Its totient is φ = 34666975612800.
The previous prime is 101112012210943. The next prime is 101112012211003. The reversal of 101112012211000 is 112210211101.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101112012211003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7222279587 + ... + 7222293586.
It is an arithmetic number, because the mean of its divisors is an integer number (4225037653395).
Almost surely, 2101112012211000 is an apocalyptic number.
101112012211000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101112012211000 is an abundant number, since it is smaller than the sum of its proper divisors (169290397606280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101112012211000 is a wasteful number, since it uses less digits than its factorization.
101112012211000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14444573201 (or 14444573187 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101112012211000 its reverse (112210211101), we get a palindrome (101224222422101).
The spelling of 101112012211000 in words is "one hundred one trillion, one hundred twelve billion, twelve million, two hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •