Base | Representation |
---|---|
bin | 110101001110100010… |
… | …0110011001110110111 |
3 | 101221001001221201200121 |
4 | 1222131010303032313 |
5 | 3333043413243111 |
6 | 124302152352411 |
7 | 11154366430030 |
oct | 1523504631667 |
9 | 357031851617 |
10 | 114304431031 |
11 | 4452696492a |
12 | 1a1a03a5707 |
13 | aa1820b20b |
14 | 5764b41a87 |
15 | 2e8ee54871 |
hex | 1a9d1333b7 |
114304431031 has 8 divisors (see below), whose sum is σ = 130813329920. Its totient is φ = 97840455768.
The previous prime is 114304431019. The next prime is 114304431061. The reversal of 114304431031 is 130134403411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114304431031 - 223 = 114296042423 is a prime.
It is a super-2 number, since 2×1143044310312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114304430987 and 114304431005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114304431061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11225451 + ... + 11235628.
It is an arithmetic number, because the mean of its divisors is an integer number (16351666240).
Almost surely, 2114304431031 is an apocalyptic number.
114304431031 is a deficient number, since it is larger than the sum of its proper divisors (16508898889).
114304431031 is an equidigital number, since it uses as much as digits as its factorization.
114304431031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22461813.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 114304431031 its reverse (130134403411), we get a palindrome (244438834442).
The spelling of 114304431031 in words is "one hundred fourteen billion, three hundred four million, four hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •