Base | Representation |
---|---|
bin | 10000100110000101111… |
… | …111011001010111001011 |
3 | 11001000121102202001100001 |
4 | 100212011333121113023 |
5 | 122141032031301443 |
6 | 2231522112423431 |
7 | 145251346540366 |
oct | 20460577312713 |
9 | 4030542661301 |
10 | 1140414322123 |
11 | 3aa71317740a |
12 | 16502a547b77 |
13 | 8370494504b |
14 | 3d2a6ac70dd |
15 | 1e9e8a29d4d |
hex | 10985fd95cb |
1140414322123 has 16 divisors (see below), whose sum is σ = 1210257401184. Its totient is φ = 1070880652800.
The previous prime is 1140414322031. The next prime is 1140414322169. The reversal of 1140414322123 is 3212234140411.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1140414322123 - 237 = 1002975368651 is a prime.
It is a super-2 number, since 2×11404143221232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1140414322091 and 1140414322100.
It is not an unprimeable number, because it can be changed into a prime (1140414326123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13483161 + ... + 13567477.
It is an arithmetic number, because the mean of its divisors is an integer number (75641087574).
Almost surely, 21140414322123 is an apocalyptic number.
1140414322123 is a deficient number, since it is larger than the sum of its proper divisors (69843079061).
1140414322123 is a wasteful number, since it uses less digits than its factorization.
1140414322123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86142.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 1140414322123 its reverse (3212234140411), we get a palindrome (4352648462534).
The spelling of 1140414322123 in words is "one trillion, one hundred forty billion, four hundred fourteen million, three hundred twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •