Base | Representation |
---|---|
bin | 11110101011010010100… |
… | …10010101010010110101 |
3 | 10201202122101210121010121 |
4 | 33111221102111102311 |
5 | 114232130022313023 |
6 | 2124114413451541 |
7 | 136102634040265 |
oct | 17255122252265 |
9 | 3652571717117 |
10 | 1054033401013 |
11 | 37701641590a |
12 | 1503417a0bb1 |
13 | 78519852c88 |
14 | 390307037a5 |
15 | 1c64027cd5d |
hex | f5694954b5 |
1054033401013 has 2 divisors, whose sum is σ = 1054033401014. Its totient is φ = 1054033401012.
The previous prime is 1054033401011. The next prime is 1054033401023. The reversal of 1054033401013 is 3101043304501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 653240582289 + 400792818724 = 808233^2 + 633082^2 .
It is a cyclic number.
It is not a de Polignac number, because 1054033401013 - 21 = 1054033401011 is a prime.
It is a super-2 number, since 2×10540334010132 (a number of 25 digits) contains 22 as substring.
Together with 1054033401011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1054033401011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527016700506 + 527016700507.
It is an arithmetic number, because the mean of its divisors is an integer number (527016700507).
Almost surely, 21054033401013 is an apocalyptic number.
It is an amenable number.
1054033401013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1054033401013 is an equidigital number, since it uses as much as digits as its factorization.
1054033401013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 1054033401013 its reverse (3101043304501), we get a palindrome (4155076705514).
The spelling of 1054033401013 in words is "one trillion, fifty-four billion, thirty-three million, four hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •