Base | Representation |
---|---|
bin | 10110111101101111110001… |
… | …101100110011110110010000 |
3 | 111020121112012100210221102202 |
4 | 112331233301230303312100 |
5 | 101214241413010134300 |
6 | 554450504552102332 |
7 | 30163011245430401 |
oct | 2675576154636620 |
9 | 436545170727382 |
10 | 101000211021200 |
11 | 2a1aaa49062457 |
12 | b3b26263949a8 |
13 | 44483820573aa |
14 | 1ad26172a99a8 |
15 | ba23a981aad5 |
hex | 5bdbf1b33d90 |
101000211021200 has 120 divisors (see below), whose sum is σ = 256938808915080. Its totient is φ = 38021818777600.
The previous prime is 101000211021181. The next prime is 101000211021253. The reversal of 101000211021200 is 2120112000101.
It can be written as a sum of positive squares in 12 ways, for example, as 3746531875216 + 97253679145984 = 1935596^2 + 9861728^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 148778540 + ... + 149455860.
It is an arithmetic number, because the mean of its divisors is an integer number (2141156740959).
Almost surely, 2101000211021200 is an apocalyptic number.
101000211021200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101000211021200 is an abundant number, since it is smaller than the sum of its proper divisors (155938597893880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101000211021200 is a wasteful number, since it uses less digits than its factorization.
101000211021200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 699285 (or 699274 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101000211021200 its reverse (2120112000101), we get a palindrome (103120323021301).
The spelling of 101000211021200 in words is "one hundred one trillion, two hundred eleven million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •