Base | Representation |
---|---|
bin | 10111000000110100001100… |
… | …111010100110110100101000 |
3 | 111021100200121001012000000012 |
4 | 113000310030322212310220 |
5 | 101231220333440121300 |
6 | 555131425213231052 |
7 | 30214155634021562 |
oct | 2700641472466450 |
9 | 437320531160005 |
10 | 101211121020200 |
11 | 2a28143927a354 |
12 | b427487792488 |
13 | 446222474b679 |
14 | 1adc904310332 |
15 | ba7b009a2435 |
hex | 5c0d0cea6d28 |
101211121020200 has 48 divisors (see below), whose sum is σ = 236615944060860. Its totient is φ = 40260777408000.
The previous prime is 101211121020181. The next prime is 101211121020209. The reversal of 101211121020200 is 2020121112101.
It can be written as a sum of positive squares in 6 ways, for example, as 4086114559396 + 97125006460804 = 2021414^2 + 9855202^2 .
It is not an unprimeable number, because it can be changed into a prime (101211121020209) 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, 1397907461 + ... + 1397979860.
Almost surely, 2101211121020200 is an apocalyptic number.
101211121020200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101211121020200 is an abundant number, since it is smaller than the sum of its proper divisors (135404823040660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101211121020200 is a wasteful number, since it uses less digits than its factorization.
101211121020200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2795887518 (or 2795887509 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101211121020200 its reverse (2020121112101), we get a palindrome (103231242132301).
The spelling of 101211121020200 in words is "one hundred one trillion, two hundred eleven billion, one hundred twenty-one million, twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •