Base | Representation |
---|---|
bin | 1110101101000001010101… |
… | …10100100010100001000110 |
3 | 11020111000201112202100011210 |
4 | 13112200222310202201012 |
5 | 13214221424422021410 |
6 | 152433403135112250 |
7 | 6544666431132234 |
oct | 726405264424106 |
9 | 136430645670153 |
10 | 32333232220230 |
11 | a3364a0732057 |
12 | 3762492072686 |
13 | 150701a707556 |
14 | 7dad1879b954 |
15 | 3b10dcc04220 |
hex | 1d682ad22846 |
32333232220230 has 32 divisors (see below), whose sum is σ = 77643133509600. Its totient is φ = 8617375683072.
The previous prime is 32333232220213. The next prime is 32333232220253. The reversal of 32333232220230 is 3202223233323.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 301168915 + ... + 301276254.
It is an arithmetic number, because the mean of its divisors is an integer number (2426347922175).
Almost surely, 232333232220230 is an apocalyptic number.
32333232220230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
32333232220230 is an abundant number, since it is smaller than the sum of its proper divisors (45309901289370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32333232220230 is a wasteful number, since it uses less digits than its factorization.
32333232220230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 602446968.
The product of its (nonzero) digits is 46656, while the sum is 30.
Adding to 32333232220230 its reverse (3202223233323), we get a palindrome (35535455453553).
The spelling of 32333232220230 in words is "thirty-two trillion, three hundred thirty-three billion, two hundred thirty-two million, two hundred twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •