Base | Representation |
---|---|
bin | 101111000010000010… |
… | …0011110000101011001 |
3 | 100122200212100012222200 |
4 | 1132010010132011121 |
5 | 3123322000341441 |
6 | 114222044440413 |
7 | 10203605636511 |
oct | 1360404360531 |
9 | 318625305880 |
10 | 101000012121 |
11 | 39919967aa8 |
12 | 176a8849109 |
13 | 96a7a522a8 |
14 | 4c61bb2841 |
15 | 2961e1e7b6 |
hex | 178411e159 |
101000012121 has 24 divisors (see below), whose sum is σ = 147358727880. Its totient is φ = 66656411136.
The previous prime is 101000012119. The next prime is 101000012143. The reversal of 101000012121 is 121210000101.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 20818161225 + 80181850896 = 144285^2 + 283164^2 .
It is not a de Polignac number, because 101000012121 - 21 = 101000012119 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (101000017121) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 783195 + ... + 902991.
It is an arithmetic number, because the mean of its divisors is an integer number (6139946995).
Almost surely, 2101000012121 is an apocalyptic number.
It is an amenable number.
101000012121 is a deficient number, since it is larger than the sum of its proper divisors (46358715759).
101000012121 is a wasteful number, since it uses less digits than its factorization.
101000012121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120745 (or 120742 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 101000012121 its reverse (121210000101), we get a palindrome (222210012222).
It can be divided in two parts, 1010000 and 12121, that added together give a square (1022121 = 10112).
The spelling of 101000012121 in words is "one hundred one billion, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •