Base | Representation |
---|---|
bin | 110101010100101101… |
… | …0110010101010000001 |
3 | 101221120111122001200112 |
4 | 1222221122302222001 |
5 | 3334004422204213 |
6 | 124334511201105 |
7 | 11162462611040 |
oct | 1525132625201 |
9 | 357514561615 |
10 | 114511522433 |
11 | 44622850750 |
12 | 1a239816195 |
13 | aa4c0a91c9 |
14 | 578444c557 |
15 | 2ea320eea8 |
hex | 1aa96b2a81 |
114511522433 has 16 divisors (see below), whose sum is σ = 142805873664. Its totient is φ = 89205844560.
The previous prime is 114511522381. The next prime is 114511522441. The reversal of 114511522433 is 334225115411.
It is not a de Polignac number, because 114511522433 - 26 = 114511522369 is a prime.
It is a super-2 number, since 2×1145115224332 (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 114511522433.
It is not an unprimeable number, because it can be changed into a prime (114511522493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 92666 + ... + 487452.
It is an arithmetic number, because the mean of its divisors is an integer number (8925367104).
Almost surely, 2114511522433 is an apocalyptic number.
It is an amenable number.
114511522433 is a deficient number, since it is larger than the sum of its proper divisors (28294351231).
114511522433 is a wasteful number, since it uses less digits than its factorization.
114511522433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 398572.
The product of its digits is 14400, while the sum is 32.
Adding to 114511522433 its reverse (334225115411), we get a palindrome (448736637844).
The spelling of 114511522433 in words is "one hundred fourteen billion, five hundred eleven million, five hundred twenty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •