Base | Representation |
---|---|
bin | 1011110110101000000111… |
… | …1001100101000110110011 |
3 | 1201010221201212001110111012 |
4 | 2331222001321211012303 |
5 | 3202013302143143443 |
6 | 43415154513341135 |
7 | 2513416422152045 |
oct | 275520171450663 |
9 | 51127655043435 |
10 | 13033110131123 |
11 | 4175346995325 |
12 | 1565aa22677ab |
13 | 73702b4b4994 |
14 | 330b3d543a95 |
15 | 17904b35b118 |
hex | bda81e651b3 |
13033110131123 has 2 divisors, whose sum is σ = 13033110131124. Its totient is φ = 13033110131122.
The previous prime is 13033110131011. The next prime is 13033110131147. The reversal of 13033110131123 is 32113101133031.
It is a strong prime.
It is an emirp because it is prime and its reverse (32113101133031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13033110131123 - 220 = 13033109082547 is a prime.
It is a super-2 number, since 2×130331101311232 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13033110131183) 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, 6516555065561 + 6516555065562.
It is an arithmetic number, because the mean of its divisors is an integer number (6516555065562).
Almost surely, 213033110131123 is an apocalyptic number.
13033110131123 is a deficient number, since it is larger than the sum of its proper divisors (1).
13033110131123 is an equidigital number, since it uses as much as digits as its factorization.
13033110131123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 13033110131123 its reverse (32113101133031), we get a palindrome (45146211264154).
The spelling of 13033110131123 in words is "thirteen trillion, thirty-three billion, one hundred ten million, one hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •