Base | Representation |
---|---|
bin | 1010111010100110111100… |
… | …0100111110011010101000 |
3 | 1120111101021011120102011121 |
4 | 2232221233010332122220 |
5 | 3033120100030401412 |
6 | 41305351012105024 |
7 | 2346054542306662 |
oct | 256515704763250 |
9 | 46441234512147 |
10 | 12002002200232 |
11 | 3908025394540 |
12 | 141a09a305174 |
13 | 690a26457555 |
14 | 2d6c8588b532 |
15 | 15c2edaba107 |
hex | aea6f13e6a8 |
12002002200232 has 64 divisors (see below), whose sum is σ = 25856328960000. Its totient is φ = 5165386822080.
The previous prime is 12002002200229. The next prime is 12002002200233. The reversal of 12002002200232 is 23200220020021.
It is not an unprimeable number, because it can be changed into a prime (12002002200233) 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, 900619 + ... + 4981477.
It is an arithmetic number, because the mean of its divisors is an integer number (404005140000).
Almost surely, 212002002200232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12002002200232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12928164480000).
12002002200232 is an abundant number, since it is smaller than the sum of its proper divisors (13854326759768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12002002200232 is a wasteful number, since it uses less digits than its factorization.
12002002200232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4082654 (or 4082650 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 16.
Adding to 12002002200232 its reverse (23200220020021), we get a palindrome (35202222220253).
The spelling of 12002002200232 in words is "twelve trillion, two billion, two million, two hundred thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •