Base | Representation |
---|---|
bin | 10000000000101001001… |
… | …010010111101110001000 |
3 | 10220011210222120012202200 |
4 | 100000221022113232020 |
5 | 121011203231242412 |
6 | 2201231555400200 |
7 | 142326015334404 |
oct | 20005112275610 |
9 | 3804728505680 |
10 | 1100202212232 |
11 | 394658515042 |
12 | 1592875b3060 |
13 | 7c996958496 |
14 | 3b3702a4104 |
15 | 1d9435e59dc |
hex | 10029297b88 |
1100202212232 has 24 divisors (see below), whose sum is σ = 2979714324990. Its totient is φ = 366734070720.
The previous prime is 1100202212209. The next prime is 1100202212261. The reversal of 1100202212232 is 2322122020011.
It can be written as a sum of positive squares in only one way, i.e., 1068854093316 + 31348118916 = 1033854^2 + 177054^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7640293069 + ... + 7640293212.
Almost surely, 21100202212232 is an apocalyptic number.
1100202212232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1100202212232 is an abundant number, since it is smaller than the sum of its proper divisors (1879512112758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100202212232 is a wasteful number, since it uses less digits than its factorization.
1100202212232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15280586293 (or 15280586286 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 1100202212232 its reverse (2322122020011), we get a palindrome (3422324232243).
The spelling of 1100202212232 in words is "one trillion, one hundred billion, two hundred two million, two hundred twelve thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •