Base | Representation |
---|---|
bin | 10110111111100000011101… |
… | …110011101010100110000100 |
3 | 111021001002111222221000112102 |
4 | 112333200131303222212010 |
5 | 101223232214241200400 |
6 | 555022235334211232 |
7 | 30204523565556311 |
oct | 2677403563524604 |
9 | 437032458830472 |
10 | 101121210100100 |
11 | 2a24729a971313 |
12 | b411b747b3b18 |
13 | 44568c62185b8 |
14 | 1ad841519dd08 |
15 | ba55dc36e9d5 |
hex | 5bf81dcea984 |
101121210100100 has 72 divisors (see below), whose sum is σ = 220009422511368. Its totient is φ = 40342284057600.
The previous prime is 101121210100093. The next prime is 101121210100121. The reversal of 101121210100100 is 1001012121101.
It can be written as a sum of positive squares in 12 ways, for example, as 15112687350016 + 86008522750084 = 3887504^2 + 9274078^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, 168648032 + ... + 169246568.
It is an arithmetic number, because the mean of its divisors is an integer number (3055686423769).
Almost surely, 2101121210100100 is an apocalyptic number.
101121210100100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101121210100100 is an abundant number, since it is smaller than the sum of its proper divisors (118888212411268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101121210100100 is a wasteful number, since it uses less digits than its factorization.
101121210100100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 602985 (or 602978 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101121210100100 its reverse (1001012121101), we get a palindrome (102122222221201).
The spelling of 101121210100100 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred ten million, one hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •