Base | Representation |
---|---|
bin | 10000001011101000100… |
… | …000001110001001001101 |
3 | 10221022021100112221200000 |
4 | 100023220200032021031 |
5 | 121204340043314041 |
6 | 2210502524554513 |
7 | 143224311534642 |
oct | 20135040161115 |
9 | 3838240487600 |
10 | 1112002323021 |
11 | 399663359a17 |
12 | 15b61b3b2a39 |
13 | 80b27574265 |
14 | 3bb6d52bdc9 |
15 | 1ddd452ebb6 |
hex | 102e880e24d |
1112002323021 has 12 divisors (see below), whose sum is σ = 1665715414272. Its totient is φ = 741334881852.
The previous prime is 1112002322929. The next prime is 1112002323031. The reversal of 1112002323021 is 1203232002111.
1112002323021 is a `hidden beast` number, since 11 + 120 + 0 + 232 + 302 + 1 = 666.
It is not a de Polignac number, because 1112002323021 - 215 = 1112002290253 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1112002322985 and 1112002323003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112002323031) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2288070381 + ... + 2288070866.
It is an arithmetic number, because the mean of its divisors is an integer number (138809617856).
Almost surely, 21112002323021 is an apocalyptic number.
It is an amenable number.
1112002323021 is a deficient number, since it is larger than the sum of its proper divisors (553713091251).
1112002323021 is an frugal number, since it uses more digits than its factorization.
1112002323021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4576141262 (or 4576141250 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1112002323021 its reverse (1203232002111), we get a palindrome (2315234325132).
The spelling of 1112002323021 in words is "one trillion, one hundred twelve billion, two million, three hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •