Base | Representation |
---|---|
bin | 110011101101101001… |
… | …0001100001101101010 |
3 | 101121122111010010002222 |
4 | 1213123102030031222 |
5 | 3304414102130242 |
6 | 123003410354042 |
7 | 11011000203425 |
oct | 1473322141552 |
9 | 347574103088 |
10 | 111053161322 |
11 | 43108683874 |
12 | 1963358b922 |
13 | a61a75b39c |
14 | 553700c9bc |
15 | 2d4e7ca5d2 |
hex | 19db48c36a |
111053161322 has 8 divisors (see below), whose sum is σ = 166583258400. Its totient is φ = 55525408524.
The previous prime is 111053161309. The next prime is 111053161367. The reversal of 111053161322 is 223161350111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1110531613222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111053161291 and 111053161300.
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 3 ways as a sum of consecutive naturals, for example, 462422 + ... + 660257.
It is an arithmetic number, because the mean of its divisors is an integer number (20822907300).
Almost surely, 2111053161322 is an apocalyptic number.
111053161322 is a deficient number, since it is larger than the sum of its proper divisors (55530097078).
111053161322 is a wasteful number, since it uses less digits than its factorization.
111053161322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1172140.
The product of its (nonzero) digits is 1080, while the sum is 26.
The spelling of 111053161322 in words is "one hundred eleven billion, fifty-three million, one hundred sixty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •