Base | Representation |
---|---|
bin | 110101001100010100… |
… | …0111000010110100111 |
3 | 101220211212220101202222 |
4 | 1222120220320112213 |
5 | 3332420340044421 |
6 | 124250533222555 |
7 | 11152504002020 |
oct | 1523050702647 |
9 | 356755811688 |
10 | 114230003111 |
11 | 4449894a054 |
12 | 1a17b491a5b |
13 | aa0597c123 |
14 | 5758cc9c47 |
15 | 2e88651cab |
hex | 1a98a385a7 |
114230003111 has 8 divisors (see below), whose sum is σ = 130717466784. Its totient is φ = 97784762400.
The previous prime is 114230003089. The next prime is 114230003149. The reversal of 114230003111 is 111300032411.
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 114230003111 - 26 = 114230003047 is a prime.
It is a super-2 number, since 2×1142300031112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114230003111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114230003411) 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, 10549940 + ... + 10560761.
It is an arithmetic number, because the mean of its divisors is an integer number (16339683348).
Almost surely, 2114230003111 is an apocalyptic number.
114230003111 is a deficient number, since it is larger than the sum of its proper divisors (16487463673).
114230003111 is an equidigital number, since it uses as much as digits as its factorization.
114230003111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21111481.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 114230003111 its reverse (111300032411), we get a palindrome (225530035522).
The spelling of 114230003111 in words is "one hundred fourteen billion, two hundred thirty million, three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •