Base | Representation |
---|---|
bin | 1011110101011101100111… |
… | …0111110100111001010001 |
3 | 1201002001010002121000122211 |
4 | 2331113121313310321101 |
5 | 3201201322433330113 |
6 | 43402050223432121 |
7 | 2512111012253005 |
oct | 275273167647121 |
9 | 51061102530584 |
10 | 13013111230033 |
11 | 41679140469a2 |
12 | 1562040755641 |
13 | 7351921032b5 |
14 | 32dba3466705 |
15 | 17877a75ab3d |
hex | bd5d9df4e51 |
13013111230033 has 8 divisors (see below), whose sum is σ = 13169971827936. Its totient is φ = 12856252444800.
The previous prime is 13013111230019. The next prime is 13013111230061. The reversal of 13013111230033 is 33003211131031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13013111230033 - 225 = 13013077675601 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13013111229986 and 13013111230013.
It is not an unprimeable number, because it can be changed into a prime (13013111230073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18986593 + ... + 19660033.
It is an arithmetic number, because the mean of its divisors is an integer number (1646246478492).
Almost surely, 213013111230033 is an apocalyptic number.
It is an amenable number.
13013111230033 is a deficient number, since it is larger than the sum of its proper divisors (156860597903).
13013111230033 is an equidigital number, since it uses as much as digits as its factorization.
13013111230033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 906335.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 13013111230033 its reverse (33003211131031), we get a palindrome (46016322361064).
The spelling of 13013111230033 in words is "thirteen trillion, thirteen billion, one hundred eleven million, two hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •