Base | Representation |
---|---|
bin | 1101101000000… |
… | …10100111111011 |
3 | 21222002022201012 |
4 | 12310002213323 |
5 | 213230234111 |
6 | 15201544135 |
7 | 2555403164 |
oct | 664024773 |
9 | 258068635 |
10 | 114305531 |
11 | 5958248a |
12 | 3234504b |
13 | 1a8b2012 |
14 | 1127676b |
15 | a07d48b |
hex | 6d029fb |
114305531 has 2 divisors, whose sum is σ = 114305532. Its totient is φ = 114305530.
The previous prime is 114305449. The next prime is 114305537. The reversal of 114305531 is 135503411.
It is a strong prime.
It is an emirp because it is prime and its reverse (135503411) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114305531 is a prime.
It is a super-2 number, since 2×1143055312 = 26131508834383922, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 114305497 and 114305506.
It is not a weakly prime, because it can be changed into another prime (114305537) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57152765 + 57152766.
It is an arithmetic number, because the mean of its divisors is an integer number (57152766).
Almost surely, 2114305531 is an apocalyptic number.
114305531 is a deficient number, since it is larger than the sum of its proper divisors (1).
114305531 is an equidigital number, since it uses as much as digits as its factorization.
114305531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 114305531 is about 10691.3764782651. The cubic root of 114305531 is about 485.3135479148.
Adding to 114305531 its reverse (135503411), we get a palindrome (249808942).
It can be divided in two parts, 11430 and 5531, that added together give a palindrome (16961).
The spelling of 114305531 in words is "one hundred fourteen million, three hundred five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •