Base | Representation |
---|---|
bin | 1110100110111110010100… |
… | …01010110000011011110011 |
3 | 11012202011102000000220112212 |
4 | 13103133022022300123303 |
5 | 13202320411232133433 |
6 | 152154121244442335 |
7 | 6523662440246210 |
oct | 723371212603363 |
9 | 135664360026485 |
10 | 32125452224243 |
11 | a2663672a9804 |
12 | 372a164b493ab |
13 | 14c0556614771 |
14 | 7d0c47320b07 |
15 | 3aa9cb740d48 |
hex | 1d37ca2b06f3 |
32125452224243 has 16 divisors (see below), whose sum is σ = 38874697654464. Its totient is φ = 25916197309440.
The previous prime is 32125452224213. The next prime is 32125452224287. The reversal of 32125452224243 is 34242225452123.
It is a cyclic number.
It is not a de Polignac number, because 32125452224243 - 28 = 32125452223987 is a prime.
It is a super-2 number, since 2×321254522242432 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 32125452224243.
It is not an unprimeable number, because it can be changed into a prime (32125452224213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27052553 + ... + 28215093.
It is an arithmetic number, because the mean of its divisors is an integer number (2429668603404).
Almost surely, 232125452224243 is an apocalyptic number.
32125452224243 is a deficient number, since it is larger than the sum of its proper divisors (6749245430221).
32125452224243 is a wasteful number, since it uses less digits than its factorization.
32125452224243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1394782.
The product of its digits is 921600, while the sum is 41.
Adding to 32125452224243 its reverse (34242225452123), we get a palindrome (66367677676366).
The spelling of 32125452224243 in words is "thirty-two trillion, one hundred twenty-five billion, four hundred fifty-two million, two hundred twenty-four thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •