Base | Representation |
---|---|
bin | 10110111101110001100010… |
… | …010011000100110000000100 |
3 | 111020121201002000110002111221 |
4 | 112331301202103010300010 |
5 | 101214304300111200400 |
6 | 554451420233410124 |
7 | 30163106124353143 |
oct | 2675614223046004 |
9 | 436551060402457 |
10 | 101002100100100 |
11 | 2a200828429391 |
12 | b3b2a72b69944 |
13 | 44485c3536064 |
14 | 1ad275612d75a |
15 | ba246a5bcc1a |
hex | 5bdc624c4c04 |
101002100100100 has 36 divisors (see below), whose sum is σ = 224520278134068. Its totient is φ = 39415453696000.
The previous prime is 101002100100043. The next prime is 101002100100119. The reversal of 101002100100100 is 1001001200101.
It can be written as a sum of positive squares in 6 ways, for example, as 30530641906116 + 70471458193984 = 5525454^2 + 8394728^2 .
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, 12317325181 + ... + 12317333380.
It is an arithmetic number, because the mean of its divisors is an integer number (6236674392613).
Almost surely, 2101002100100100 is an apocalyptic number.
101002100100100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101002100100100 is an abundant number, since it is smaller than the sum of its proper divisors (123518178033968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101002100100100 is a wasteful number, since it uses less digits than its factorization.
101002100100100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24634658616 (or 24634658609 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 101002100100100 its reverse (1001001200101), we get a palindrome (102003101300201).
The spelling of 101002100100100 in words is "one hundred one trillion, two billion, one hundred million, one hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •