Base | Representation |
---|---|
bin | 110101001101001011… |
… | …0011000111110100001 |
3 | 101220220212220212211010 |
4 | 1222122112120332201 |
5 | 3333000212213213 |
6 | 124253440411133 |
7 | 11153303004600 |
oct | 1523226307641 |
9 | 356825825733 |
10 | 114258710433 |
11 | 4450307730a |
12 | 1a189016aa9 |
13 | aa0b8c08ca |
14 | 575ca3da37 |
15 | 2e8ae22ac3 |
hex | 1a9a598fa1 |
114258710433 has 24 divisors (see below), whose sum is σ = 177259114368. Its totient is φ = 65275394016.
The previous prime is 114258710431. The next prime is 114258710491. The reversal of 114258710433 is 334017852411.
It is not a de Polignac number, because 114258710433 - 21 = 114258710431 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114258710391 and 114258710400.
It is not an unprimeable number, because it can be changed into a prime (114258710431) 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 23 ways as a sum of consecutive naturals, for example, 553960 + ... + 731702.
It is an arithmetic number, because the mean of its divisors is an integer number (7385796432).
Almost surely, 2114258710433 is an apocalyptic number.
It is an amenable number.
114258710433 is a deficient number, since it is larger than the sum of its proper divisors (63000403935).
114258710433 is a wasteful number, since it uses less digits than its factorization.
114258710433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182133 (or 182126 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 39.
The spelling of 114258710433 in words is "one hundred fourteen billion, two hundred fifty-eight million, seven hundred ten thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •