Base | Representation |
---|---|
bin | 10000001101110100000… |
… | …010011111100001100011 |
3 | 10221112022111120221102102 |
4 | 100031310002133201203 |
5 | 121224133343341011 |
6 | 2211531113041015 |
7 | 143336316051500 |
oct | 20156402374143 |
9 | 3845274527372 |
10 | 1114343340131 |
11 | 39a6548457aa |
12 | 15bb733b616b |
13 | 8110b57ab98 |
14 | 3bd123d64a7 |
15 | 1debed0473b |
hex | 1037409f863 |
1114343340131 has 24 divisors (see below), whose sum is σ = 1372656770496. Its totient is φ = 898882064640.
The previous prime is 1114343340113. The next prime is 1114343340203. The reversal of 1114343340131 is 1310433434111.
It is a de Polignac number, because none of the positive numbers 2k-1114343340131 is a prime.
It is a super-2 number, since 2×11143433401312 (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 = 1114343340094 and 1114343340103.
It is not an unprimeable number, because it can be changed into a prime (1114343342131) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9790310 + ... + 9903476.
It is an arithmetic number, because the mean of its divisors is an integer number (57194032104).
Almost surely, 21114343340131 is an apocalyptic number.
1114343340131 is a deficient number, since it is larger than the sum of its proper divisors (258313430365).
1114343340131 is a wasteful number, since it uses less digits than its factorization.
1114343340131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 125019 (or 125012 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 1114343340131 its reverse (1310433434111), we get a palindrome (2424776774242).
The spelling of 1114343340131 in words is "one trillion, one hundred fourteen billion, three hundred forty-three million, three hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •