Base | Representation |
---|---|
bin | 11001111010111010110001… |
… | …101001011100000010100111 |
3 | 112221122021221011202102210210 |
4 | 121322322301221130002213 |
5 | 104420234001103303143 |
6 | 1042242513401150503 |
7 | 33004141222111206 |
oct | 3172726151340247 |
9 | 487567834672723 |
10 | 114000002400423 |
11 | 33362147421287 |
12 | 10951b6a18b433 |
13 | 4b7c20072a659 |
14 | 20218b570723d |
15 | d2a6059e4033 |
hex | 67aeb1a5c0a7 |
114000002400423 has 8 divisors (see below), whose sum is σ = 152029500601968. Its totient is φ = 75985252899584.
The previous prime is 114000002400413. The next prime is 114000002400469. The reversal of 114000002400423 is 324004200000411.
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 114000002400423 - 212 = 114000002396327 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 114000002400423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114000002400413) 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, 3687157140 + ... + 3687188057.
It is an arithmetic number, because the mean of its divisors is an integer number (19003687575246).
Almost surely, 2114000002400423 is an apocalyptic number.
114000002400423 is a deficient number, since it is larger than the sum of its proper divisors (38029498201545).
114000002400423 is an equidigital number, since it uses as much as digits as its factorization.
114000002400423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7374350353.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 114000002400423 its reverse (324004200000411), we get a palindrome (438004202400834).
The spelling of 114000002400423 in words is "one hundred fourteen trillion, two million, four hundred thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •