Base | Representation |
---|---|
bin | 110101000110001110… |
… | …0011110101000001111 |
3 | 101220022121221202221120 |
4 | 1222030130132220033 |
5 | 3332011002103143 |
6 | 124214344332023 |
7 | 11144441060430 |
oct | 1521434365017 |
9 | 356277852846 |
10 | 114025425423 |
11 | 443a341a888 |
12 | 1a122a74013 |
13 | a9a2481340 |
14 | 5739a75487 |
15 | 2e756e1383 |
hex | 1a8c71ea0f |
114025425423 has 16 divisors (see below), whose sum is σ = 187118647296. Its totient is φ = 60145279200.
The previous prime is 114025425403. The next prime is 114025425431. The reversal of 114025425423 is 324524520411.
It is not a de Polignac number, because 114025425423 - 25 = 114025425391 is a prime.
It is a super-2 number, since 2×1140254254232 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114025425403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 208837503 + ... + 208838048.
It is an arithmetic number, because the mean of its divisors is an integer number (11694915456).
Almost surely, 2114025425423 is an apocalyptic number.
114025425423 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
114025425423 is a deficient number, since it is larger than the sum of its proper divisors (73093221873).
114025425423 is a wasteful number, since it uses less digits than its factorization.
114025425423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417675574.
The product of its (nonzero) digits is 38400, while the sum is 33.
Adding to 114025425423 its reverse (324524520411), we get a palindrome (438549945834).
The spelling of 114025425423 in words is "one hundred fourteen billion, twenty-five million, four hundred twenty-five thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •