Base | Representation |
---|---|
bin | 11101011111011101100… |
… | …01010111000001001011 |
3 | 10120212120020102200221102 |
4 | 32233232301113001023 |
5 | 113100241221400212 |
6 | 2053303025332015 |
7 | 133132044231002 |
oct | 16575661270113 |
9 | 3525506380842 |
10 | 1013323231307 |
11 | 360825601862 |
12 | 14447ba9700b |
13 | 7472c61046a |
14 | 3708bab1c39 |
15 | 1b55b2655c2 |
hex | ebeec5704b |
1013323231307 has 2 divisors, whose sum is σ = 1013323231308. Its totient is φ = 1013323231306.
The previous prime is 1013323231289. The next prime is 1013323231313. The reversal of 1013323231307 is 7031323233101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1013323231307 - 26 = 1013323231243 is a prime.
It is a super-2 number, since 2×10133232313072 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1013323231307.
It is not a weakly prime, because it can be changed into another prime (1013323231007) 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, 506661615653 + 506661615654.
It is an arithmetic number, because the mean of its divisors is an integer number (506661615654).
Almost surely, 21013323231307 is an apocalyptic number.
1013323231307 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013323231307 is an equidigital number, since it uses as much as digits as its factorization.
1013323231307 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 29.
Adding to 1013323231307 its reverse (7031323233101), we get a palindrome (8044646464408).
The spelling of 1013323231307 in words is "one trillion, thirteen billion, three hundred twenty-three million, two hundred thirty-one thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •