Base | Representation |
---|---|
bin | 10111000000101011111001… |
… | …110101100100111110001011 |
3 | 111021022211121002102002100120 |
4 | 113000223321311210332023 |
5 | 101231044112004001303 |
6 | 555123353124434323 |
7 | 30213422063061105 |
oct | 2700537165447613 |
9 | 437284532362316 |
10 | 101202211000203 |
11 | 2a278686856465 |
12 | b4257bb8489a3 |
13 | 44614348141a1 |
14 | 1adc2dac3c575 |
15 | ba777d64b553 |
hex | 5c0af9d64f8b |
101202211000203 has 8 divisors (see below), whose sum is σ = 135423415924368. Its totient is φ = 67224573371424.
The previous prime is 101202211000183. The next prime is 101202211000237. The reversal of 101202211000203 is 302000112202101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101202211000203 - 220 = 101202209951627 is a prime.
It is a super-2 number, since 2×1012022110002032 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101202211000703) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60891822876 + ... + 60891824537.
It is an arithmetic number, because the mean of its divisors is an integer number (16927926990546).
Almost surely, 2101202211000203 is an apocalyptic number.
101202211000203 is a deficient number, since it is larger than the sum of its proper divisors (34221204924165).
101202211000203 is a wasteful number, since it uses less digits than its factorization.
101202211000203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121783647693.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 101202211000203 its reverse (302000112202101), we get a palindrome (403202323202304).
The spelling of 101202211000203 in words is "one hundred one trillion, two hundred two billion, two hundred eleven million, two hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •