Base | Representation |
---|---|
bin | 10000010100001101011… |
… | …101001000001001101110 |
3 | 10222012001012120100202020 |
4 | 100110031131020021232 |
5 | 121332220311004010 |
6 | 2215024444411010 |
7 | 144001453324551 |
oct | 20241535101156 |
9 | 3865035510666 |
10 | 1121212203630 |
11 | 3a255a0715a2 |
12 | 16136b846a66 |
13 | 8196465ac5c |
14 | 3c3a4778698 |
15 | 1e272d68470 |
hex | 1050d74826e |
1121212203630 has 32 divisors (see below), whose sum is σ = 2753488577664. Its totient is φ = 292036666656.
The previous prime is 1121212203619. The next prime is 1121212203653. The reversal of 1121212203630 is 363022121211.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1121212203630.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 434577084 + ... + 434579663.
It is an arithmetic number, because the mean of its divisors is an integer number (86046518052).
Almost surely, 21121212203630 is an apocalyptic number.
1121212203630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1121212203630 is an abundant number, since it is smaller than the sum of its proper divisors (1632276374034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121212203630 is a wasteful number, since it uses less digits than its factorization.
1121212203630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 869156800.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 1121212203630 its reverse (363022121211), we get a palindrome (1484234324841).
The spelling of 1121212203630 in words is "one trillion, one hundred twenty-one billion, two hundred twelve million, two hundred three thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.984 sec. • engine limits •