Base | Representation |
---|---|
bin | 1001000110101110101101… |
… | …1101101100110111110101 |
3 | 1022110001201102121021201221 |
4 | 2101223223131230313311 |
5 | 2303010441400401123 |
6 | 33143032023150341 |
7 | 2052200316626116 |
oct | 221535335546765 |
9 | 38401642537657 |
10 | 10011224231413 |
11 | 320a8110a5229 |
12 | 11582aa8a53b1 |
13 | 578092672582 |
14 | 26878dacc20d |
15 | 12563552625d |
hex | 91aeb76cdf5 |
10011224231413 has 2 divisors, whose sum is σ = 10011224231414. Its totient is φ = 10011224231412.
The previous prime is 10011224231321. The next prime is 10011224231423. The reversal of 10011224231413 is 31413242211001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8810407142289 + 1200817089124 = 2968233^2 + 1095818^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011224231413 - 241 = 7812200975861 is a prime.
It is a super-2 number, since 2×100112242314132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10011224231423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005612115706 + 5005612115707.
It is an arithmetic number, because the mean of its divisors is an integer number (5005612115707).
Almost surely, 210011224231413 is an apocalyptic number.
It is an amenable number.
10011224231413 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011224231413 is an equidigital number, since it uses as much as digits as its factorization.
10011224231413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 10011224231413 its reverse (31413242211001), we get a palindrome (41424466442414).
The spelling of 10011224231413 in words is "ten trillion, eleven billion, two hundred twenty-four million, two hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •