Base | Representation |
---|---|
bin | 1011110110100001000011… |
… | …0101110110111110011101 |
3 | 1201010202211122212222222002 |
4 | 2331220100311312332131 |
5 | 3202000411103032313 |
6 | 43414242354332045 |
7 | 2513321420465432 |
oct | 275502065667635 |
9 | 51122748788862 |
10 | 13031213330333 |
11 | 4174563224870 |
12 | 1565652b8a025 |
13 | 736ab8531353 |
14 | 3309dd66db89 |
15 | 178e89a81058 |
hex | bda10d76f9d |
13031213330333 has 16 divisors (see below), whose sum is σ = 14384888340480. Its totient is φ = 11706451470000.
The previous prime is 13031213330327. The next prime is 13031213330341. The reversal of 13031213330333 is 33303331213031.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 13031213330333 - 220 = 13031212281757 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13031213330296 and 13031213330305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13031213230333) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18231023 + ... + 18932316.
It is an arithmetic number, because the mean of its divisors is an integer number (899055521280).
Almost surely, 213031213330333 is an apocalyptic number.
It is an amenable number.
13031213330333 is a deficient number, since it is larger than the sum of its proper divisors (1353675010147).
13031213330333 is a wasteful number, since it uses less digits than its factorization.
13031213330333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37163728.
The product of its (nonzero) digits is 13122, while the sum is 29.
Adding to 13031213330333 its reverse (33303331213031), we get a palindrome (46334544543364).
The spelling of 13031213330333 in words is "thirteen trillion, thirty-one billion, two hundred thirteen million, three hundred thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •