Base | Representation |
---|---|
bin | 11101011111000100011… |
… | …11011011100010000111 |
3 | 10120212000120212100221121 |
4 | 32233202033123202013 |
5 | 113044323412312221 |
6 | 2053230115454411 |
7 | 133123612333543 |
oct | 16574217334207 |
9 | 3525016770847 |
10 | 1013113010311 |
11 | 3607279786a6 |
12 | 1444215b7407 |
13 | 746c7bb7b3c |
14 | 3706bbcca23 |
15 | 1b547a8ca41 |
hex | ebe23db887 |
1013113010311 has 2 divisors, whose sum is σ = 1013113010312. Its totient is φ = 1013113010310.
The previous prime is 1013113010297. The next prime is 1013113010323. The reversal of 1013113010311 is 1130103113101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1013113010311 - 25 = 1013113010279 is a prime.
It is a super-2 number, since 2×10131130103112 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013113014311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506556505155 + 506556505156.
It is an arithmetic number, because the mean of its divisors is an integer number (506556505156).
Almost surely, 21013113010311 is an apocalyptic number.
1013113010311 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013113010311 is an equidigital number, since it uses as much as digits as its factorization.
1013113010311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 1013113010311 its reverse (1130103113101), we get a palindrome (2143216123412).
The spelling of 1013113010311 in words is "one trillion, thirteen billion, one hundred thirteen million, ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •