Base | Representation |
---|---|
bin | 10111000000101001110110… |
… | …000011010010100000110101 |
3 | 111021022121220000000202010222 |
4 | 113000221312003102200311 |
5 | 101231030100000031401 |
6 | 555122345503224125 |
7 | 30213313224644360 |
oct | 2700516603224065 |
9 | 437277800022128 |
10 | 101200000002101 |
11 | 2a2777517a4900 |
12 | b4252a32a8045 |
13 | 44611717318a0 |
14 | 1adc16b33b0d7 |
15 | ba769e4aac1b |
hex | 5c0a760d2835 |
101200000002101 has 96 divisors (see below), whose sum is σ = 139738585916160. Its totient is φ = 71300608220160.
The previous prime is 101200000002071. The next prime is 101200000002109.
101200000002101 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 101200000002101 - 218 = 101199999739957 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101200000002109) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 104375195 + ... + 105340311.
It is an arithmetic number, because the mean of its divisors is an integer number (1455610269960).
Almost surely, 2101200000002101 is an apocalyptic number.
101200000002101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101200000002101 is a deficient number, since it is larger than the sum of its proper divisors (38538585914059).
101200000002101 is a wasteful number, since it uses less digits than its factorization.
101200000002101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 965355 (or 965344 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
It can be divided in two parts, 10120000000 and 2101, that added together give a palindrome (10120002101).
The spelling of 101200000002101 in words is "one hundred one trillion, two hundred billion, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •