Base | Representation |
---|---|
bin | 1110100111000111001101… |
… | …11100101001011101100110 |
3 | 11012202121201222022200222020 |
4 | 13103203212330221131212 |
5 | 13202410202342012410 |
6 | 152200231321444010 |
7 | 6524222024040441 |
oct | 723434674513546 |
9 | 135677658280866 |
10 | 32130230032230 |
11 | a268399246650 |
12 | 372b079040606 |
13 | 14c0b38418c95 |
14 | 7d117baa4658 |
15 | 3aabaae07a70 |
hex | 1d38e6f29766 |
32130230032230 has 64 divisors (see below), whose sum is σ = 84304475163648. Its totient is φ = 7772323426560.
The previous prime is 32130230032193. The next prime is 32130230032237. The reversal of 32130230032230 is 3223003203123.
It is a self number, because there is not a number n which added to its sum of digits gives 32130230032230.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32130230032237) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 104992279 + ... + 105297858.
It is an arithmetic number, because the mean of its divisors is an integer number (1317257424432).
Almost surely, 232130230032230 is an apocalyptic number.
32130230032230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
32130230032230 is an abundant number, since it is smaller than the sum of its proper divisors (52174245131418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32130230032230 is a wasteful number, since it uses less digits than its factorization.
32130230032230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210290621.
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 32130230032230 its reverse (3223003203123), we get a palindrome (35353233235353).
The spelling of 32130230032230 in words is "thirty-two trillion, one hundred thirty billion, two hundred thirty million, thirty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •