Base | Representation |
---|---|
bin | 1100000110111000100100… |
… | …0011110101001101111110 |
3 | 1202010122122021010000022101 |
4 | 3001232021003311031332 |
5 | 3221102300200231220 |
6 | 44151344503535314 |
7 | 2542534521412411 |
oct | 301561103651576 |
9 | 52118567100271 |
10 | 13312403133310 |
11 | 4272838573696 |
12 | 15b0048a5a53a |
13 | 75747b319358 |
14 | 340476523b78 |
15 | 181445b9830a |
hex | c1b890f537e |
13312403133310 has 32 divisors (see below), whose sum is σ = 25224568214400. Its totient is φ = 5044486626720.
The previous prime is 13312403133299. The next prime is 13312403133311. The reversal of 13312403133310 is 1333130421331.
It is a super-2 number, since 2×133124031333102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13312403133311) 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 in 15 ways as a sum of consecutive naturals, for example, 3054825 + ... + 5996395.
It is an arithmetic number, because the mean of its divisors is an integer number (788267756700).
Almost surely, 213312403133310 is an apocalyptic number.
13312403133310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13312403133310 is a deficient number, since it is larger than the sum of its proper divisors (11912165081090).
13312403133310 is a wasteful number, since it uses less digits than its factorization.
13312403133310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2965416.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 13312403133310 its reverse (1333130421331), we get a palindrome (14645533554641).
The spelling of 13312403133310 in words is "thirteen trillion, three hundred twelve billion, four hundred three million, one hundred thirty-three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •