Base | Representation |
---|---|
bin | 110101000110011111… |
… | …0001001000110001011 |
3 | 101220100020120010011022 |
4 | 1222030332021012023 |
5 | 3332020232000443 |
6 | 124215301423055 |
7 | 11144606063423 |
oct | 1521476110613 |
9 | 356306503138 |
10 | 114034250123 |
11 | 443a83a7a22 |
12 | 1a125a0aa8b |
13 | a9a4250c61 |
14 | 573acd1483 |
15 | 2e76385e68 |
hex | 1a8cf8918b |
114034250123 has 4 divisors (see below), whose sum is σ = 114036284520. Its totient is φ = 114032215728.
The previous prime is 114034250117. The next prime is 114034250153. The reversal of 114034250123 is 321052430411.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 114034250123 - 222 = 114030055819 is a prime.
It is a super-2 number, since 2×1140342501232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114034250092 and 114034250101.
It is not an unprimeable number, because it can be changed into a prime (114034250153) 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, 930665 + ... + 1046042.
It is an arithmetic number, because the mean of its divisors is an integer number (28509071130).
Almost surely, 2114034250123 is an apocalyptic number.
114034250123 is a deficient number, since it is larger than the sum of its proper divisors (2034397).
114034250123 is an equidigital number, since it uses as much as digits as its factorization.
114034250123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2034396.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 114034250123 its reverse (321052430411), we get a palindrome (435086680534).
The spelling of 114034250123 in words is "one hundred fourteen billion, thirty-four million, two hundred fifty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •