Base | Representation |
---|---|
bin | 1110101100011011111001… |
… | …01001100101010101010011 |
3 | 11020102002211121100010000211 |
4 | 13112031330221211111103 |
5 | 13213404242320242121 |
6 | 152420240324024551 |
7 | 6543355330140643 |
oct | 726157451452523 |
9 | 136362747303024 |
10 | 32313130243411 |
11 | a328a15691376 |
12 | 375a601b32157 |
13 | 1505165b76404 |
14 | 7d9d6cb2c523 |
15 | 3b0813042ce1 |
hex | 1d637ca65553 |
32313130243411 has 4 divisors (see below), whose sum is σ = 32355149919400. Its totient is φ = 32271110567424.
The previous prime is 32313130243399. The next prime is 32313130243477. The reversal of 32313130243411 is 11434203131323.
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 32313130243411 - 221 = 32313128146259 is a prime.
It is a super-2 number, since 2×323131302434112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32313130243481) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21009836841 + ... + 21009838378.
It is an arithmetic number, because the mean of its divisors is an integer number (8088787479850).
Almost surely, 232313130243411 is an apocalyptic number.
32313130243411 is a deficient number, since it is larger than the sum of its proper divisors (42019675989).
32313130243411 is an equidigital number, since it uses as much as digits as its factorization.
32313130243411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42019675988.
The product of its (nonzero) digits is 15552, while the sum is 31.
Adding to 32313130243411 its reverse (11434203131323), we get a palindrome (43747333374734).
The spelling of 32313130243411 in words is "thirty-two trillion, three hundred thirteen billion, one hundred thirty million, two hundred forty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •