Base | Representation |
---|---|
bin | 110101000110011001… |
… | …0111101101111010111 |
3 | 101220100001001020211002 |
4 | 1222030302331233113 |
5 | 3332014004220043 |
6 | 124215114533515 |
7 | 11144542141025 |
oct | 1521462755727 |
9 | 356301036732 |
10 | 114031320023 |
11 | 443a6786555 |
12 | 1a124a3729b |
13 | a9a376637a |
14 | 573a76b715 |
15 | 2e75ea7bb8 |
hex | 1a8ccbdbd7 |
114031320023 has 4 divisors (see below), whose sum is σ = 114397980528. Its totient is φ = 113664659520.
The previous prime is 114031320001. The next prime is 114031320097. The reversal of 114031320023 is 320023130411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114031320023 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114031319977 and 114031320004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114031320323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 183329786 + ... + 183330407.
It is an arithmetic number, because the mean of its divisors is an integer number (28599495132).
Almost surely, 2114031320023 is an apocalyptic number.
114031320023 is a deficient number, since it is larger than the sum of its proper divisors (366660505).
114031320023 is an equidigital number, since it uses as much as digits as its factorization.
114031320023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366660504.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 114031320023 its reverse (320023130411), we get a palindrome (434054450434).
The spelling of 114031320023 in words is "one hundred fourteen billion, thirty-one million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •