Base | Representation |
---|---|
bin | 11001100010001100100100… |
… | …011011101000010100011010 |
3 | 112201121212211012220000102211 |
4 | 121202030210123220110122 |
5 | 104204420144001030242 |
6 | 1034502231155145334 |
7 | 32440326320321353 |
oct | 3142144433502432 |
9 | 481555735800384 |
10 | 112301121111322 |
11 | 32867702201860 |
12 | 107188622a524a |
13 | 4a87c479c72c0 |
14 | 1da35907a8d2a |
15 | ceb323505317 |
hex | 6623246e851a |
112301121111322 has 128 divisors (see below), whose sum is σ = 209847449564928. Its totient is φ = 44283135283200.
The previous prime is 112301121111299. The next prime is 112301121111323. The reversal of 112301121111322 is 223111121103211.
It is a super-2 number, since 2×1123011211113222 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 112301121111293 and 112301121111302.
It is not an unprimeable number, because it can be changed into a prime (112301121111323) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 15419620293 + ... + 15419627575.
It is an arithmetic number, because the mean of its divisors is an integer number (1639433199726).
Almost surely, 2112301121111322 is an apocalyptic number.
112301121111322 is a deficient number, since it is larger than the sum of its proper divisors (97546328453606).
112301121111322 is a wasteful number, since it uses less digits than its factorization.
112301121111322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11504.
The product of its (nonzero) digits is 144, while the sum is 22.
Adding to 112301121111322 its reverse (223111121103211), we get a palindrome (335412242214533).
The spelling of 112301121111322 in words is "one hundred twelve trillion, three hundred one billion, one hundred twenty-one million, one hundred eleven thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •