Base | Representation |
---|---|
bin | 10110111101111010110001… |
… | …000010001010100101011000 |
3 | 111020122122122201120002022002 |
4 | 112331322301002022211120 |
5 | 101214440044304032300 |
6 | 554500135514420132 |
7 | 30163606540550354 |
oct | 2675726102124530 |
9 | 436578581502262 |
10 | 101012011002200 |
11 | 2a204a53918871 |
12 | b3b497a131648 |
13 | 444951292907c |
14 | 1ad30164dc464 |
15 | ba284a72b5d5 |
hex | 5bdeb108a958 |
101012011002200 has 48 divisors (see below), whose sum is σ = 234998526408480. Its totient is φ = 40379754796160.
The previous prime is 101012011002169. The next prime is 101012011002211. The reversal of 101012011002200 is 2200110210101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 156236624 + ... + 156881823.
It is an arithmetic number, because the mean of its divisors is an integer number (4895802633510).
Almost surely, 2101012011002200 is an apocalyptic number.
101012011002200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101012011002200 is an abundant number, since it is smaller than the sum of its proper divisors (133986515406280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101012011002200 is a wasteful number, since it uses less digits than its factorization.
101012011002200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313120076 (or 313120067 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101012011002200 its reverse (2200110210101), we get a palindrome (103212121212301).
The spelling of 101012011002200 in words is "one hundred one trillion, twelve billion, eleven million, two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •