Base | Representation |
---|---|
bin | 110101010111101011… |
… | …1011110000110111011 |
3 | 101221211110102001112101 |
4 | 1222233113132012323 |
5 | 3334210444041011 |
6 | 124352434124231 |
7 | 11165114050615 |
oct | 1525727360673 |
9 | 357743361471 |
10 | 114611315131 |
11 | 44674110455 |
12 | 1a267120677 |
13 | aa66979541 |
14 | 57937c7db5 |
15 | 2eabd732c1 |
hex | 1aaf5de1bb |
114611315131 has 2 divisors, whose sum is σ = 114611315132. Its totient is φ = 114611315130.
The previous prime is 114611315129. The next prime is 114611315153. The reversal of 114611315131 is 131513116411.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 114611315131 - 21 = 114611315129 is a prime.
It is a super-2 number, since 2×1146113151312 (a number of 23 digits) contains 22 as substring.
Together with 114611315129, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 114611315131.
It is not a weakly prime, because it can be changed into another prime (114611315431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57305657565 + 57305657566.
It is an arithmetic number, because the mean of its divisors is an integer number (57305657566).
Almost surely, 2114611315131 is an apocalyptic number.
114611315131 is a deficient number, since it is larger than the sum of its proper divisors (1).
114611315131 is an equidigital number, since it uses as much as digits as its factorization.
114611315131 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1080, while the sum is 28.
The spelling of 114611315131 in words is "one hundred fourteen billion, six hundred eleven million, three hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •