Base | Representation |
---|---|
bin | 1110101010010100011101… |
… | …10111011001110110000110 |
3 | 11020011011011101211210100110 |
4 | 13111022032313121312012 |
5 | 13211211340340142410 |
6 | 152323013425253450 |
7 | 6535202461234203 |
oct | 725121667316606 |
9 | 136134141753313 |
10 | 32240421412230 |
11 | a3000a4421349 |
12 | 37484aba94286 |
13 | 14cb349472795 |
14 | 7d6632464caa |
15 | 3ad9a9c05720 |
hex | 1d528edd9d86 |
32240421412230 has 32 divisors (see below), whose sum is σ = 81928600295904. Its totient is φ = 8091713609216.
The previous prime is 32240421412219. The next prime is 32240421412231. The reversal of 32240421412230 is 3221412404223.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32240421412231) 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, 31608255777 + ... + 31608256796.
It is an arithmetic number, because the mean of its divisors is an integer number (2560268759247).
Almost surely, 232240421412230 is an apocalyptic number.
32240421412230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
32240421412230 is an abundant number, since it is smaller than the sum of its proper divisors (49688178883674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32240421412230 is a wasteful number, since it uses less digits than its factorization.
32240421412230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63216512600.
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 32240421412230 its reverse (3221412404223), we get a palindrome (35461833816453).
The spelling of 32240421412230 in words is "thirty-two trillion, two hundred forty billion, four hundred twenty-one million, four hundred twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •