Base | Representation |
---|---|
bin | 10111000000110100000110… |
… | …010111010111110001001000 |
3 | 111021100200022101101111112211 |
4 | 113000310012113113301020 |
5 | 101231220122321321300 |
6 | 555131410245514504 |
7 | 30214153130624452 |
oct | 2700640627276110 |
9 | 437320271344484 |
10 | 101211011120200 |
11 | 2a281392236903 |
12 | b427456a12a34 |
13 | 4462207a4c997 |
14 | 1adc8d38a32d2 |
15 | ba7ae5ee44ba |
hex | 5c0d065d7c48 |
101211011120200 has 48 divisors (see below), whose sum is σ = 235316422468080. Its totient is φ = 40484263095360.
The previous prime is 101211011120161. The next prime is 101211011120207. The reversal of 101211011120200 is 2021110112101.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (101211011120207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 71213739 + ... + 72621061.
It is an arithmetic number, because the mean of its divisors is an integer number (4902425468085).
Almost surely, 2101211011120200 is an apocalyptic number.
101211011120200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101211011120200 is an abundant number, since it is smaller than the sum of its proper divisors (134105411347880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101211011120200 is a wasteful number, since it uses less digits than its factorization.
101211011120200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1766926 (or 1766917 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101211011120200 its reverse (2021110112101), we get a palindrome (103232121232301).
The spelling of 101211011120200 in words is "one hundred one trillion, two hundred eleven billion, eleven million, one hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •