Base | Representation |
---|---|
bin | 1011110101011001111000… |
… | …1101100111111001111001 |
3 | 1201001221112100012001220202 |
4 | 2331112132031213321321 |
5 | 3201142300214423113 |
6 | 43401403030331545 |
7 | 2512044136503551 |
oct | 275263615477171 |
9 | 51057470161822 |
10 | 13012110311033 |
11 | 4167450055709 |
12 | 1561a014b9bb5 |
13 | 735062933a32 |
14 | 32db0a55a161 |
15 | 17871c947258 |
hex | bd59e367e79 |
13012110311033 has 8 divisors (see below), whose sum is σ = 13700116473120. Its totient is φ = 12324419974080.
The previous prime is 13012110311023. The next prime is 13012110311051. The reversal of 13012110311033 is 33011301121031.
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 13012110311033 - 210 = 13012110310009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13012110310996 and 13012110311014.
It is not an unprimeable number, because it can be changed into a prime (13012110311023) 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, 78871703 + ... + 79036508.
It is an arithmetic number, because the mean of its divisors is an integer number (1712514559140).
Almost surely, 213012110311033 is an apocalyptic number.
It is an amenable number.
13012110311033 is a deficient number, since it is larger than the sum of its proper divisors (688006162087).
13012110311033 is a wasteful number, since it uses less digits than its factorization.
13012110311033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157912567.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 13012110311033 its reverse (33011301121031), we get a palindrome (46023411432064).
The spelling of 13012110311033 in words is "thirteen trillion, twelve billion, one hundred ten million, three hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •