Base | Representation |
---|---|
bin | 110101001110011010… |
… | …1100011011100101110 |
3 | 101221000210102200002122 |
4 | 1222130311203130232 |
5 | 3333041402343342 |
6 | 124301530552542 |
7 | 11154320442362 |
oct | 1523465433456 |
9 | 357023380078 |
10 | 114300434222 |
11 | 44524684a87 |
12 | 1a19ab98752 |
13 | aa1743bc40 |
14 | 57643c12a2 |
15 | 2e8e9154d2 |
hex | 1a9cd6372e |
114300434222 has 8 divisors (see below), whose sum is σ = 184639163016. Its totient is φ = 52754046552.
The previous prime is 114300434221. The next prime is 114300434249. The reversal of 114300434222 is 222434003411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 4396170547 = 114300434222 / (1 + 1 + 4 + 3 + 0 + 0 + 4 + 3 + 4 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 114300434191 and 114300434200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114300434221) 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, 2198085248 + ... + 2198085299.
It is an arithmetic number, because the mean of its divisors is an integer number (23079895377).
Almost surely, 2114300434222 is an apocalyptic number.
114300434222 is a deficient number, since it is larger than the sum of its proper divisors (70338728794).
114300434222 is a wasteful number, since it uses less digits than its factorization.
114300434222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4396170562.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 114300434222 its reverse (222434003411), we get a palindrome (336734437633).
The spelling of 114300434222 in words is "one hundred fourteen billion, three hundred million, four hundred thirty-four thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •