Base | Representation |
---|---|
bin | 10000010100000001100… |
… | …110000010100000110000 |
3 | 10222011112100010121020111 |
4 | 100110001212002200300 |
5 | 121331313340310412 |
6 | 2214553015351104 |
7 | 143663516043613 |
oct | 20240146024060 |
9 | 3864470117214 |
10 | 1121013213232 |
11 | 3a2467809120 |
12 | 161315082494 |
13 | 81932368363 |
14 | 3c38617a17a |
15 | 1e26065d2a7 |
hex | 10501982830 |
1121013213232 has 80 divisors (see below), whose sum is σ = 2405577354624. Its totient is φ = 501779520000.
The previous prime is 1121013213217. The next prime is 1121013213317. The reversal of 1121013213232 is 2323123101211.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39736732 + ... + 39764932.
Almost surely, 21121013213232 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 1121013213232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1202788677312).
1121013213232 is an abundant number, since it is smaller than the sum of its proper divisors (1284564141392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121013213232 is a wasteful number, since it uses less digits than its factorization.
1121013213232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31658 (or 31652 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 1121013213232 its reverse (2323123101211), we get a palindrome (3444136314443).
The spelling of 1121013213232 in words is "one trillion, one hundred twenty-one billion, thirteen million, two hundred thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •