Base | Representation |
---|---|
bin | 110101011010100100… |
… | …1001010111111101011 |
3 | 101222002012202211220112 |
4 | 1222311021022333223 |
5 | 3334410301330443 |
6 | 124410215244535 |
7 | 11200401603614 |
oct | 1526511127753 |
9 | 358065684815 |
10 | 114708230123 |
11 | 44713895093 |
12 | 1a29367974b |
13 | aa80a7caa6 |
14 | 57a2614c0b |
15 | 2eb5618b18 |
hex | 1ab524afeb |
114708230123 has 4 divisors (see below), whose sum is σ = 114751997808. Its totient is φ = 114664462440.
The previous prime is 114708230101. The next prime is 114708230171. The reversal of 114708230123 is 321032807411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 321032807411 = 315691 ⋅1016921.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114708230123 is a prime.
It is a super-2 number, since 2×1147082301232 (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 114708230123.
It is not an unprimeable number, because it can be changed into a prime (114708230173) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21879911 + ... + 21885152.
It is an arithmetic number, because the mean of its divisors is an integer number (28687999452).
Almost surely, 2114708230123 is an apocalyptic number.
114708230123 is a deficient number, since it is larger than the sum of its proper divisors (43767685).
114708230123 is an equidigital number, since it uses as much as digits as its factorization.
114708230123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43767684.
The product of its (nonzero) digits is 8064, while the sum is 32.
The spelling of 114708230123 in words is "one hundred fourteen billion, seven hundred eight million, two hundred thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •