Base | Representation |
---|---|
bin | 11010101010000000… |
… | …10101010010010001 |
3 | 1100221100202210022000 |
4 | 31111000111102101 |
5 | 213302112134213 |
6 | 10324023304213 |
7 | 1014432636636 |
oct | 152500252221 |
9 | 40840683260 |
10 | 14311052433 |
11 | 6084241567 |
12 | 29348ab069 |
13 | 1470ba9582 |
14 | 99a92618d |
15 | 58b5c6c73 |
hex | 355015491 |
14311052433 has 32 divisors (see below), whose sum is σ = 22154496000. Its totient is φ = 9113048208.
The previous prime is 14311052417. The next prime is 14311052467. The reversal of 14311052433 is 33425011341.
It is a happy number.
It is not a de Polignac number, because 14311052433 - 24 = 14311052417 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 14311052397 and 14311052406.
It is not an unprimeable number, because it can be changed into a prime (14311052473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 435618 + ... + 467316.
It is an arithmetic number, because the mean of its divisors is an integer number (692328000).
Almost surely, 214311052433 is an apocalyptic number.
It is an amenable number.
14311052433 is a deficient number, since it is larger than the sum of its proper divisors (7843443567).
14311052433 is a wasteful number, since it uses less digits than its factorization.
14311052433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32458 (or 32452 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 14311052433 its reverse (33425011341), we get a palindrome (47736063774).
The spelling of 14311052433 in words is "fourteen billion, three hundred eleven million, fifty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •