Base | Representation |
---|---|
bin | 110101010010000101… |
… | …0000001111001000011 |
3 | 101221100100111222010020 |
4 | 1222210022001321003 |
5 | 3333314322223212 |
6 | 124322035104523 |
7 | 11160341340423 |
oct | 1524412017103 |
9 | 357310458106 |
10 | 114423242307 |
11 | 44587a34570 |
12 | 1a214142143 |
13 | aa36a0a04a |
14 | 577682c483 |
15 | 2e9a5c2d8c |
hex | 1aa4281e43 |
114423242307 has 8 divisors (see below), whose sum is σ = 166433807040. Its totient is φ = 69347419560.
The previous prime is 114423242281. The next prime is 114423242359. The reversal of 114423242307 is 703242324411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114423242307 - 224 = 114406465091 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 3467370979 = 114423242307 / (1 + 1 + 4 + 4 + 2 + 3 + 2 + 4 + 2 + 3 + 0 + 7).
It is not an unprimeable number, because it can be changed into a prime (114423242387) 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, 1733685457 + ... + 1733685522.
It is an arithmetic number, because the mean of its divisors is an integer number (20804225880).
Almost surely, 2114423242307 is an apocalyptic number.
114423242307 is a deficient number, since it is larger than the sum of its proper divisors (52010564733).
114423242307 is a wasteful number, since it uses less digits than its factorization.
114423242307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3467370993.
The product of its (nonzero) digits is 32256, while the sum is 33.
Adding to 114423242307 its reverse (703242324411), we get a palindrome (817665566718).
The spelling of 114423242307 in words is "one hundred fourteen billion, four hundred twenty-three million, two hundred forty-two thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •