Base | Representation |
---|---|
bin | 11101111100111001011… |
… | …11011101101000111101 |
3 | 10122101100121202210212202 |
4 | 32332130233131220331 |
5 | 113330122434342423 |
6 | 2104435132241245 |
7 | 134231503035041 |
oct | 16763457355075 |
9 | 3571317683782 |
10 | 1029126871613 |
11 | 3674a5320715 |
12 | 147550610225 |
13 | 7607a7b5309 |
14 | 37b4a92c021 |
15 | 1bb838c0728 |
hex | ef9cbdda3d |
1029126871613 has 2 divisors, whose sum is σ = 1029126871614. Its totient is φ = 1029126871612.
The previous prime is 1029126871609. The next prime is 1029126871657. The reversal of 1029126871613 is 3161786219201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 931219210009 + 97907661604 = 964997^2 + 312902^2 .
It is a cyclic number.
It is not a de Polignac number, because 1029126871613 - 22 = 1029126871609 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1029126871673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 514563435806 + 514563435807.
It is an arithmetic number, because the mean of its divisors is an integer number (514563435807).
Almost surely, 21029126871613 is an apocalyptic number.
It is an amenable number.
1029126871613 is a deficient number, since it is larger than the sum of its proper divisors (1).
1029126871613 is an equidigital number, since it uses as much as digits as its factorization.
1029126871613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 217728, while the sum is 47.
The spelling of 1029126871613 in words is "one trillion, twenty-nine billion, one hundred twenty-six million, eight hundred seventy-one thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •