Base | Representation |
---|---|
bin | 10000010100001110100… |
… | …010001111000111100100 |
3 | 10222012002110122202212121 |
4 | 100110032202033013210 |
5 | 121332234430220400 |
6 | 2215030332555324 |
7 | 144002063320342 |
oct | 20241642170744 |
9 | 3865073582777 |
10 | 1121230320100 |
11 | 3a2569315790 |
12 | 161375922b44 |
13 | 81968331c67 |
14 | 3c3a6d32992 |
15 | 1e27474621a |
hex | 1050e88f1e4 |
1121230320100 has 36 divisors (see below), whose sum is σ = 2654257960368. Its totient is φ = 407720116000.
The previous prime is 1121230320097. The next prime is 1121230320101. The reversal of 1121230320100 is 10230321211.
It is not an unprimeable number, because it can be changed into a prime (1121230320101) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 509649046 + ... + 509651245.
It is an arithmetic number, because the mean of its divisors is an integer number (73729387788).
Almost surely, 21121230320100 is an apocalyptic number.
1121230320100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1121230320100 is an abundant number, since it is smaller than the sum of its proper divisors (1533027640268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121230320100 is a wasteful number, since it uses less digits than its factorization.
1121230320100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1019300316 (or 1019300309 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1121230320100 its reverse (10230321211), we get a palindrome (1131460641311).
The spelling of 1121230320100 in words is "one trillion, one hundred twenty-one billion, two hundred thirty million, three hundred twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •