Base | Representation |
---|---|
bin | 10000010100000110110… |
… | …101010011011111101000 |
3 | 10222011202110111202122012 |
4 | 100110012311103133220 |
5 | 121332003340213112 |
6 | 2215005435215052 |
7 | 143665634061353 |
oct | 20240665233750 |
9 | 3864673452565 |
10 | 1121101101032 |
11 | 3a2502387570 |
12 | 16133a5a7488 |
13 | 8194762aa83 |
14 | 3c393ad729a |
15 | 1e26821e022 |
hex | 10506d537e8 |
1121101101032 has 32 divisors (see below), whose sum is σ = 2310666415200. Its totient is φ = 505701393600.
The previous prime is 1121101101019. The next prime is 1121101101041. The reversal of 1121101101032 is 2301011011211.
It is a junction number, because it is equal to n+sod(n) for n = 1121101100998 and 1121101101016.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48613607 + ... + 48636662.
It is an arithmetic number, because the mean of its divisors is an integer number (72208325475).
Almost surely, 21121101101032 is an apocalyptic number.
It is an amenable number.
1121101101032 is an abundant number, since it is smaller than the sum of its proper divisors (1189565314168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121101101032 is a wasteful number, since it uses less digits than its factorization.
1121101101032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97250417 (or 97250413 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1121101101032 its reverse (2301011011211), we get a palindrome (3422112112243).
The spelling of 1121101101032 in words is "one trillion, one hundred twenty-one billion, one hundred one million, one hundred one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •