Base | Representation |
---|---|
bin | 1110100111011011010100… |
… | …10010000101010101101001 |
3 | 11012210122121011221122220000 |
4 | 13103231222102011111221 |
5 | 13203044303442320241 |
6 | 152205214325053213 |
7 | 6525053344131012 |
oct | 723555222052551 |
9 | 135718534848800 |
10 | 32141023401321 |
11 | a271a2788259a |
12 | 373118b857209 |
13 | 14c1b685a7103 |
14 | 7d18c3348009 |
15 | 3ab0dd77ceb6 |
hex | 1d3b6a485569 |
32141023401321 has 40 divisors (see below), whose sum is σ = 48325856899584. Its totient is φ = 21288071725920.
The previous prime is 32141023401259. The next prime is 32141023401329. The reversal of 32141023401321 is 12310432014123.
32141023401321 is a `hidden beast` number, since 3 + 2 + 1 + 410 + 234 + 0 + 13 + 2 + 1 = 666.
It is not a de Polignac number, because 32141023401321 - 233 = 32132433466729 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (32141023401329) 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 39 ways as a sum of consecutive naturals, for example, 10855791 + ... + 13495563.
Almost surely, 232141023401321 is an apocalyptic number.
It is an amenable number.
32141023401321 is a deficient number, since it is larger than the sum of its proper divisors (16184833498263).
32141023401321 is a wasteful number, since it uses less digits than its factorization.
32141023401321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2640763 (or 2640754 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 32141023401321 its reverse (12310432014123), we get a palindrome (44451455415444).
The spelling of 32141023401321 in words is "thirty-two trillion, one hundred forty-one billion, twenty-three million, four hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •