Base | Representation |
---|---|
bin | 110101001110000001… |
… | …0010110100110000111 |
3 | 101220222212011202120212 |
4 | 1222130002112212013 |
5 | 3333024433342411 |
6 | 124300331150035 |
7 | 11154065401250 |
oct | 1523402264607 |
9 | 356885152525 |
10 | 114287012231 |
11 | 44518047927 |
12 | 1a1965a531b |
13 | aa1471c932 |
14 | 57626c9b27 |
15 | 2e8d66368b |
hex | 1a9c096987 |
114287012231 has 8 divisors (see below), whose sum is σ = 130633682304. Its totient is φ = 97945330680.
The previous prime is 114287012183. The next prime is 114287012263. The reversal of 114287012231 is 132210782411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114287012231 is a prime.
It is a super-2 number, since 2×1142870122312 (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 (114287012731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1197905 + ... + 1289786.
It is an arithmetic number, because the mean of its divisors is an integer number (16329210288).
Almost surely, 2114287012231 is an apocalyptic number.
114287012231 is a deficient number, since it is larger than the sum of its proper divisors (16346670073).
114287012231 is an equidigital number, since it uses as much as digits as its factorization.
114287012231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2494261.
The product of its (nonzero) digits is 5376, while the sum is 32.
Adding to 114287012231 its reverse (132210782411), we get a palindrome (246497794642).
The spelling of 114287012231 in words is "one hundred fourteen billion, two hundred eighty-seven million, twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •