Base | Representation |
---|---|
bin | 110101010100110010… |
… | …1100101000010111111 |
3 | 101221120200221201202021 |
4 | 1222221211211002333 |
5 | 3334011133202041 |
6 | 124335051541011 |
7 | 11162525626336 |
oct | 1525145450277 |
9 | 357520851667 |
10 | 114514350271 |
11 | 44624402302 |
12 | 1a23a75a767 |
13 | aa4c859399 |
14 | 5784986d1d |
15 | 2ea35bccd1 |
hex | 1aa99650bf |
114514350271 has 4 divisors (see below), whose sum is σ = 118463121000. Its totient is φ = 110565579544.
The previous prime is 114514350191. The next prime is 114514350319. The reversal of 114514350271 is 172053415411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 172053415411 = 71 ⋅2423287541.
It is a cyclic number.
It is not a de Polignac number, because 114514350271 - 27 = 114514350143 is a prime.
It is a super-2 number, since 2×1145143502712 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114514350371) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1974385321 + ... + 1974385378.
It is an arithmetic number, because the mean of its divisors is an integer number (29615780250).
Almost surely, 2114514350271 is an apocalyptic number.
114514350271 is a deficient number, since it is larger than the sum of its proper divisors (3948770729).
114514350271 is an equidigital number, since it uses as much as digits as its factorization.
114514350271 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3948770728.
The product of its (nonzero) digits is 16800, while the sum is 34.
Adding to 114514350271 its reverse (172053415411), we get a palindrome (286567765682).
The spelling of 114514350271 in words is "one hundred fourteen billion, five hundred fourteen million, three hundred fifty thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •