Base | Representation |
---|---|
bin | 10111000000110101000111… |
… | …111111101010000101000000 |
3 | 111021100210011010021011002011 |
4 | 113000311013333222011000 |
5 | 101231224401210400000 |
6 | 555132111421502304 |
7 | 30214222330635604 |
oct | 2700650777520500 |
9 | 437323133234064 |
10 | 101212112200000 |
11 | 2a2818a781940a |
12 | b427703711994 |
13 | 4462351bbaca9 |
14 | 1adc999c03504 |
15 | ba7b5c9e02ba |
hex | 5c0d47fea140 |
101212112200000 has 84 divisors (see below), whose sum is σ = 251037414506844. Its totient is φ = 40484844800000.
The previous prime is 101212112199983. The next prime is 101212112200019. The reversal of 101212112200000 is 2211212101.
It can be written as a sum of positive squares in 6 ways, for example, as 65983518904576 + 35228593295424 = 8123024^2 + 5935368^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 252830281 + ... + 253230280.
It is an arithmetic number, because the mean of its divisors is an integer number (2988540648891).
Almost surely, 2101212112200000 is an apocalyptic number.
101212112200000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101212112200000 is an abundant number, since it is smaller than the sum of its proper divisors (149825302306844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101212112200000 is an frugal number, since it uses more digits than its factorization.
101212112200000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 506060598 (or 506060568 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101212112200000 its reverse (2211212101), we get a palindrome (101214323412101).
The spelling of 101212112200000 in words is "one hundred one trillion, two hundred twelve billion, one hundred twelve million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •