Base | Representation |
---|---|
bin | 110101000101011110… |
… | …1100110001001010011 |
3 | 101220020220011002202100 |
4 | 1222022331212021103 |
5 | 3331433120140111 |
6 | 124212055251443 |
7 | 11144016464625 |
oct | 1521275461123 |
9 | 356226132670 |
10 | 114000552531 |
11 | 44390381478 |
12 | 1a116679b83 |
13 | a99a282c58 |
14 | 573663cc15 |
15 | 2e7342b756 |
hex | 1a8af66253 |
114000552531 has 6 divisors (see below), whose sum is σ = 164667464780. Its totient is φ = 76000368348.
The previous prime is 114000552509. The next prime is 114000552541. The reversal of 114000552531 is 135255000411.
114000552531 is a `hidden beast` number, since 1 + 1 + 400 + 0 + 5 + 5 + 253 + 1 = 666.
It is not a de Polignac number, because 114000552531 - 29 = 114000552019 is a prime.
It is a super-2 number, since 2×1140005525312 (a number of 23 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 = 114000552495 and 114000552504.
It is not an unprimeable number, because it can be changed into a prime (114000552541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6333364021 + ... + 6333364038.
Almost surely, 2114000552531 is an apocalyptic number.
114000552531 is a deficient number, since it is larger than the sum of its proper divisors (50666912249).
114000552531 is a wasteful number, since it uses less digits than its factorization.
114000552531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12666728065 (or 12666728062 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 114000552531 its reverse (135255000411), we get a palindrome (249255552942).
The spelling of 114000552531 in words is "one hundred fourteen billion, five hundred fifty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •