Base | Representation |
---|---|
bin | 11000110101011010… |
… | …11100100110011011 |
3 | 1021102012102202022112 |
4 | 30122231130212123 |
5 | 204301223220011 |
6 | 10043004542535 |
7 | 651255553361 |
oct | 143255344633 |
9 | 37365382275 |
10 | 13333023131 |
11 | 572216468a |
12 | 2701251a4b |
13 | 13463927cc |
14 | 906a97631 |
15 | 5307d558b |
hex | 31ab5c99b |
13333023131 has 4 divisors (see below), whose sum is σ = 13335979392. Its totient is φ = 13330066872.
The previous prime is 13333023103. The next prime is 13333023133. The reversal of 13333023131 is 13132033331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13333023131 - 214 = 13333006747 is a prime.
It is a super-2 number, since 2×133330231312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13333023097 and 13333023106.
It is not an unprimeable number, because it can be changed into a prime (13333023133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1471355 + ... + 1480388.
It is an arithmetic number, because the mean of its divisors is an integer number (3333994848).
Almost surely, 213333023131 is an apocalyptic number.
13333023131 is a deficient number, since it is larger than the sum of its proper divisors (2956261).
13333023131 is an equidigital number, since it uses as much as digits as its factorization.
13333023131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2956260.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 13333023131 its reverse (13132033331), we get a palindrome (26465056462).
The spelling of 13333023131 in words is "thirteen billion, three hundred thirty-three million, twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •