Base | Representation |
---|---|
bin | 1001001011111001111000… |
… | …1000011011000110111001 |
3 | 1022202120011210210012010210 |
4 | 2102332132020123012321 |
5 | 2310440022001334314 |
6 | 33251533120101333 |
7 | 2061465263004000 |
oct | 222763610330671 |
9 | 38676153705123 |
10 | 10100121121209 |
11 | 324448a077299 |
12 | 117157a164849 |
13 | 58358ba95302 |
14 | 26cbc42bbc37 |
15 | 127ad9b05559 |
hex | 92f9e21b1b9 |
10100121121209 has 16 divisors (see below), whose sum is σ = 15704755875200. Its totient is φ = 5771497782960.
The previous prime is 10100121121187. The next prime is 10100121121213. The reversal of 10100121121209 is 90212112100101.
It is not a de Polignac number, because 10100121121209 - 27 = 10100121121081 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (10100121121289) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 4907735182 + ... + 4907737239.
It is an arithmetic number, because the mean of its divisors is an integer number (981547242200).
Almost surely, 210100121121209 is an apocalyptic number.
It is an amenable number.
10100121121209 is a deficient number, since it is larger than the sum of its proper divisors (5604634753991).
10100121121209 is an frugal number, since it uses more digits than its factorization.
10100121121209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9815472445 (or 9815472431 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 21.
The spelling of 10100121121209 in words is "ten trillion, one hundred billion, one hundred twenty-one million, one hundred twenty-one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •