Base | Representation |
---|---|
bin | 1110100110110110000110… |
… | …01011111101100100111101 |
3 | 11012201202000111220102101100 |
4 | 13103123003023331210331 |
5 | 13202232342233214123 |
6 | 152152111354203313 |
7 | 6523445214136551 |
oct | 723330313754475 |
9 | 135652014812340 |
10 | 32121040132413 |
11 | a264502840921 |
12 | 3729333423539 |
13 | 14c0002509a3b |
14 | 7d0949379861 |
15 | 3aa81e219643 |
hex | 1d36c32fd93d |
32121040132413 has 24 divisors (see below), whose sum is σ = 47093125320800. Its totient is φ = 21092813416224.
The previous prime is 32121040132387. The next prime is 32121040132487. The reversal of 32121040132413 is 31423104012123.
32121040132413 is a `hidden beast` number, since 3 + 2 + 1 + 2 + 10 + 401 + 3 + 241 + 3 = 666.
It is not a de Polignac number, because 32121040132413 - 217 = 32121040001341 is a prime.
It is a super-2 number, since 2×321210401324132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32121040132213) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5956203 + ... + 9985911.
Almost surely, 232121040132413 is an apocalyptic number.
It is an amenable number.
32121040132413 is a deficient number, since it is larger than the sum of its proper divisors (14972085188387).
32121040132413 is a wasteful number, since it uses less digits than its factorization.
32121040132413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4043001 (or 4042998 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 32121040132413 its reverse (31423104012123), we get a palindrome (63544144144536).
The spelling of 32121040132413 in words is "thirty-two trillion, one hundred twenty-one billion, forty million, one hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •