Base | Representation |
---|---|
bin | 11011000000100100… |
… | …00111110100011001 |
3 | 1101102112210210110210 |
4 | 31200102013310121 |
5 | 214144031441431 |
6 | 10354503001333 |
7 | 1022221135530 |
oct | 154022076431 |
9 | 41375723423 |
10 | 14500265241 |
11 | 6171026990 |
12 | 2988139249 |
13 | 14a1157907 |
14 | 9b7adb317 |
15 | 59ceeed46 |
hex | 360487d19 |
14500265241 has 32 divisors (see below), whose sum is σ = 24121506816. Its totient is φ = 7527240000.
The previous prime is 14500265239. The next prime is 14500265251. The reversal of 14500265241 is 14256200541.
It is not a de Polignac number, because 14500265241 - 21 = 14500265239 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 14500265199 and 14500265208.
It is not an unprimeable number, because it can be changed into a prime (14500265251) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 313551 + ... + 356811.
It is an arithmetic number, because the mean of its divisors is an integer number (753797088).
Almost surely, 214500265241 is an apocalyptic number.
14500265241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14500265241 is a deficient number, since it is larger than the sum of its proper divisors (9621241575).
14500265241 is a wasteful number, since it uses less digits than its factorization.
14500265241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44733.
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 14500265241 its reverse (14256200541), we get a palindrome (28756465782).
The spelling of 14500265241 in words is "fourteen billion, five hundred million, two hundred sixty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •