Base | Representation |
---|---|
bin | 1001000110110010000001… |
… | …0001000110100100000101 |
3 | 1022110011000011120011002120 |
4 | 2101230200101012210011 |
5 | 2303014300142334341 |
6 | 33143255551000153 |
7 | 2052231264566205 |
oct | 221544021064405 |
9 | 38404004504076 |
10 | 10012110121221 |
11 | 321012616a36a |
12 | 11584b7509059 |
13 | 5781a4068620 |
14 | 268835614405 |
15 | 1256881b7066 |
hex | 91b20446905 |
10012110121221 has 8 divisors (see below), whose sum is σ = 14376363251040. Its totient is φ = 6161298536112.
The previous prime is 10012110121151. The next prime is 10012110121229. The reversal of 10012110121221 is 12212101121001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10012110121221 - 218 = 10012109859077 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10012110121221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10012110121229) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 128360386131 + ... + 128360386208.
It is an arithmetic number, because the mean of its divisors is an integer number (1797045406380).
Almost surely, 210012110121221 is an apocalyptic number.
It is an amenable number.
10012110121221 is a deficient number, since it is larger than the sum of its proper divisors (4364253129819).
10012110121221 is a wasteful number, since it uses less digits than its factorization.
10012110121221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256720772355.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10012110121221 its reverse (12212101121001), we get a palindrome (22224211242222).
The spelling of 10012110121221 in words is "ten trillion, twelve billion, one hundred ten million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •