Base | Representation |
---|---|
bin | 10000010011001011011… |
… | …101111010110110011000 |
3 | 10222002012001101102200211 |
4 | 100103023131322312120 |
5 | 121322433402140112 |
6 | 2214322535540504 |
7 | 143632151246161 |
oct | 20231335726630 |
9 | 3862161342624 |
10 | 1120105115032 |
11 | 3a2041155542 |
12 | 161100b2a734 |
13 | 81819197947 |
14 | 3c2db712768 |
15 | 1e20aa820a7 |
hex | 104cb77ad98 |
1120105115032 has 16 divisors (see below), whose sum is σ = 2151421410600. Its totient is φ = 546392738880.
The previous prime is 1120105115023. The next prime is 1120105115047. The reversal of 1120105115032 is 2305115010211.
It is a super-2 number, since 2×11201051150322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1120105114994 and 1120105115012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1707476982 + ... + 1707477637.
Almost surely, 21120105115032 is an apocalyptic number.
It is an amenable number.
1120105115032 is a deficient number, since it is larger than the sum of its proper divisors (1031316295568).
1120105115032 is a wasteful number, since it uses less digits than its factorization.
1120105115032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3414954666 (or 3414954662 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 22.
The spelling of 1120105115032 in words is "one trillion, one hundred twenty billion, one hundred five million, one hundred fifteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •