Base | Representation |
---|---|
bin | 1101100000010100000… |
… | …0010110011100100000 |
3 | 211011212022220112210220 |
4 | 3120011000112130200 |
5 | 12300130111241000 |
6 | 254330202523040 |
7 | 22522323156102 |
oct | 3300500263440 |
9 | 734768815726 |
10 | 232012212000 |
11 | 8a439932958 |
12 | 38b70506480 |
13 | 18b56545c5a |
14 | b32d883572 |
15 | 607da741a0 |
hex | 3605016720 |
232012212000 has 96 divisors (see below), whose sum is σ = 760072045824. Its totient is φ = 61869920000.
The previous prime is 232012211923. The next prime is 232012212037. The reversal of 232012212000 is 212210232.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9655176 + ... + 9679175.
It is an arithmetic number, because the mean of its divisors is an integer number (7917417144).
Almost surely, 2232012212000 is an apocalyptic number.
232012212000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
232012212000 is an abundant number, since it is smaller than the sum of its proper divisors (528059833824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232012212000 is a wasteful number, since it uses less digits than its factorization.
232012212000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19334379 (or 19334361 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 232012212000 its reverse (212210232), we get a palindrome (232224422232).
The spelling of 232012212000 in words is "two hundred thirty-two billion, twelve million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •