Base | Representation |
---|---|
bin | 1001001101001011110101… |
… | …1011101110101010001001 |
3 | 1022211122222000122112020222 |
4 | 2103102331123232222021 |
5 | 2311320101001042301 |
6 | 33310012132155425 |
7 | 2063204411564300 |
oct | 223227533565211 |
9 | 38748860575228 |
10 | 10122121112201 |
11 | 325284953712a |
12 | 1175899a68b75 |
13 | 585686913167 |
14 | 26dcb0059437 |
15 | 12847623131b |
hex | 934bd6eea89 |
10122121112201 has 48 divisors (see below), whose sum is σ = 12736892044800. Its totient is φ = 7989314715648.
The previous prime is 10122121112179. The next prime is 10122121112209. The reversal of 10122121112201 is 10221112122101.
It is not a de Polignac number, because 10122121112201 - 210 = 10122121111177 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 10122121112201.
It is not an unprimeable number, because it can be changed into a prime (10122121112209) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 120503945 + ... + 120587913.
It is an arithmetic number, because the mean of its divisors is an integer number (265351917600).
Almost surely, 210122121112201 is an apocalyptic number.
It is an amenable number.
10122121112201 is a deficient number, since it is larger than the sum of its proper divisors (2614770932599).
10122121112201 is a wasteful number, since it uses less digits than its factorization.
10122121112201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87126 (or 87119 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10122121112201 its reverse (10221112122101), we get a palindrome (20343233234302).
The spelling of 10122121112201 in words is "ten trillion, one hundred twenty-two billion, one hundred twenty-one million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.197 sec. • engine limits •