Base | Representation |
---|---|
bin | 1001001100100110001101… |
… | …1011101100111110000001 |
3 | 1022210200220010220220111201 |
4 | 2103021203123230332001 |
5 | 2311133404413034444 |
6 | 33301222020341201 |
7 | 2062366212123133 |
oct | 223114333547601 |
9 | 38720803826451 |
10 | 10112021221249 |
11 | 32495363a5612 |
12 | 117393b544801 |
13 | 58473731ca1c |
14 | 26d5d2933053 |
15 | 1280846e0dd4 |
hex | 932636ecf81 |
10112021221249 has 2 divisors, whose sum is σ = 10112021221250. Its totient is φ = 10112021221248.
The previous prime is 10112021221207. The next prime is 10112021221261. The reversal of 10112021221249 is 94212212021101.
10112021221249 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10084003483024 + 28017738225 = 3175532^2 + 167385^2 .
It is an emirp because it is prime and its reverse (94212212021101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10112021221249 - 213 = 10112021213057 is a prime.
It is not a weakly prime, because it can be changed into another prime (10112021225249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056010610624 + 5056010610625.
It is an arithmetic number, because the mean of its divisors is an integer number (5056010610625).
Almost surely, 210112021221249 is an apocalyptic number.
It is an amenable number.
10112021221249 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112021221249 is an equidigital number, since it uses as much as digits as its factorization.
10112021221249 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 28.
The spelling of 10112021221249 in words is "ten trillion, one hundred twelve billion, twenty-one million, two hundred twenty-one thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •