Base | Representation |
---|---|
bin | 1001001101001011110101… |
… | …1111100100111100101001 |
3 | 1022211122222002112210001221 |
4 | 2103102331133210330221 |
5 | 2311320101230333001 |
6 | 33310012205542041 |
7 | 2063204423265352 |
oct | 223227537447451 |
9 | 38748862483057 |
10 | 10122122121001 |
11 | 325284a066050 |
12 | 117589a274921 |
13 | 585686ba7397 |
14 | 26dcb023cd29 |
15 | 1284763801a1 |
hex | 934bd7e4f29 |
10122122121001 has 64 divisors (see below), whose sum is σ = 11410932589056. Its totient is φ = 8901633024000.
The previous prime is 10122122120977. The next prime is 10122122121017. The reversal of 10122122121001 is 10012122122101.
It is a cyclic number.
It is not a de Polignac number, because 10122122121001 - 25 = 10122122120969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10122122121101) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 9522221596 + ... + 9522222658.
It is an arithmetic number, because the mean of its divisors is an integer number (178295821704).
Almost surely, 210122122121001 is an apocalyptic number.
10122122121001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10122122121001 is a deficient number, since it is larger than the sum of its proper divisors (1288810468055).
10122122121001 is a wasteful number, since it uses less digits than its factorization.
10122122121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2242.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10122122121001 its reverse (10012122122101), we get a palindrome (20134244243102).
It can be divided in two parts, 101221 and 22121001, that added together give a palindrome (22222222).
The spelling of 10122122121001 in words is "ten trillion, one hundred twenty-two billion, one hundred twenty-two million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •