Base | Representation |
---|---|
bin | 110101001001111110… |
… | …1011010110110101111 |
3 | 101220122102012002102221 |
4 | 1222103331122312233 |
5 | 3332240241014411 |
6 | 124235050500211 |
7 | 11150531515405 |
oct | 1522375326657 |
9 | 356572162387 |
10 | 114151501231 |
11 | 44458601469 |
12 | 1a159134667 |
13 | a9c2624901 |
14 | 574c6d3475 |
15 | 2e817e7071 |
hex | 1a93f5adaf |
114151501231 has 4 divisors (see below), whose sum is σ = 120159475000. Its totient is φ = 108143527464.
The previous prime is 114151501223. The next prime is 114151501253. The reversal of 114151501231 is 132105151411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 114151501231 - 23 = 114151501223 is a prime.
It is a super-2 number, since 2×1141515012312 (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 = 114151501196 and 114151501205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114151501831) 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, 3003986856 + ... + 3003986893.
It is an arithmetic number, because the mean of its divisors is an integer number (30039868750).
Almost surely, 2114151501231 is an apocalyptic number.
114151501231 is a deficient number, since it is larger than the sum of its proper divisors (6007973769).
114151501231 is an equidigital number, since it uses as much as digits as its factorization.
114151501231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6007973768.
The product of its (nonzero) digits is 600, while the sum is 25.
Adding to 114151501231 its reverse (132105151411), we get a palindrome (246256652642).
The spelling of 114151501231 in words is "one hundred fourteen billion, one hundred fifty-one million, five hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •