Base | Representation |
---|---|
bin | 11001111110011010010011… |
… | …110100000001000100011111 |
3 | 112222111020110102021010001011 |
4 | 121332122103310001010133 |
5 | 104433202030111310011 |
6 | 1042545050220000051 |
7 | 33030366123214363 |
oct | 3176322364010437 |
9 | 488436412233034 |
10 | 114240020025631 |
11 | 33444a14089605 |
12 | 10990593690027 |
13 | 4b98a316605a6 |
14 | 202d3644632a3 |
15 | d319a2282621 |
hex | 67e693d0111f |
114240020025631 has 2 divisors, whose sum is σ = 114240020025632. Its totient is φ = 114240020025630.
The previous prime is 114240020025583. The next prime is 114240020025667. The reversal of 114240020025631 is 136520020042411.
It is a strong prime.
It is an emirp because it is prime and its reverse (136520020042411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114240020025631 - 235 = 114205660287263 is a prime.
It is a super-2 number, since 2×1142400200256312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114240020025593 and 114240020025602.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114240020025731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57120010012815 + 57120010012816.
It is an arithmetic number, because the mean of its divisors is an integer number (57120010012816).
Almost surely, 2114240020025631 is an apocalyptic number.
114240020025631 is a deficient number, since it is larger than the sum of its proper divisors (1).
114240020025631 is an equidigital number, since it uses as much as digits as its factorization.
114240020025631 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11520, while the sum is 31.
The spelling of 114240020025631 in words is "one hundred fourteen trillion, two hundred forty billion, twenty million, twenty-five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •