Base | Representation |
---|---|
bin | 10000001101100110110… |
… | …111000001101000110001 |
3 | 10221111202002112101210012 |
4 | 100031212313001220301 |
5 | 121223210242332241 |
6 | 2211453133544305 |
7 | 143330662463462 |
oct | 20154667015061 |
9 | 3844662471705 |
10 | 1114122230321 |
11 | 39a550a54721 |
12 | 15bb11345095 |
13 | 810a4812289 |
14 | 3bcd0cbad69 |
15 | 1deaa6ca6eb |
hex | 10366dc1a31 |
1114122230321 has 4 divisors (see below), whose sum is σ = 1135143404532. Its totient is φ = 1093101056112.
The previous prime is 1114122230303. The next prime is 1114122230359. The reversal of 1114122230321 is 1230322214111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 290856354721 + 823265875600 = 539311^2 + 907340^2 .
It is a cyclic number.
It is not a de Polignac number, because 1114122230321 - 26 = 1114122230257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1114122230371) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10510587026 + ... + 10510587131.
It is an arithmetic number, because the mean of its divisors is an integer number (283785851133).
Almost surely, 21114122230321 is an apocalyptic number.
It is an amenable number.
1114122230321 is a deficient number, since it is larger than the sum of its proper divisors (21021174211).
1114122230321 is an equidigital number, since it uses as much as digits as its factorization.
1114122230321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21021174210.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1114122230321 its reverse (1230322214111), we get a palindrome (2344444444432).
The spelling of 1114122230321 in words is "one trillion, one hundred fourteen billion, one hundred twenty-two million, two hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •