Base | Representation |
---|---|
bin | 11010100100011001… |
… | …10110011111100110 |
3 | 1100211002020101222011 |
4 | 31102030312133212 |
5 | 213203041040114 |
6 | 10315223024434 |
7 | 1013322010135 |
oct | 152214663746 |
9 | 40732211864 |
10 | 14264002534 |
11 | 605a726251 |
12 | 2920b9b11a |
13 | 1464214bb2 |
14 | 99459991c |
15 | 5873d11c4 |
hex | 3523367e6 |
14264002534 has 48 divisors (see below), whose sum is σ = 22860665856. Its totient is φ = 6667725600.
The previous prime is 14264002531. The next prime is 14264002547. The reversal of 14264002534 is 43520046241.
It is a hoax number, since the sum of its digits (31) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 14264002496 and 14264002505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14264002531) 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, 13834599 + ... + 13835629.
It is an arithmetic number, because the mean of its divisors is an integer number (476263872).
Almost surely, 214264002534 is an apocalyptic number.
14264002534 is a deficient number, since it is larger than the sum of its proper divisors (8596663322).
14264002534 is a wasteful number, since it uses less digits than its factorization.
14264002534 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1301 (or 1264 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 14264002534 its reverse (43520046241), we get a palindrome (57784048775).
The spelling of 14264002534 in words is "fourteen billion, two hundred sixty-four million, two thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •