Base | Representation |
---|---|
bin | 11010011110010100… |
… | …10011101111011111 |
3 | 1100200112021102111000 |
4 | 31033022103233133 |
5 | 213102012114010 |
6 | 10310202001343 |
7 | 1012132354122 |
oct | 151712235737 |
9 | 40615242430 |
10 | 14213004255 |
11 | 603396350a |
12 | 2907aa6253 |
13 | 145679a2b8 |
14 | 98b8c23b9 |
15 | 582baa7c0 |
hex | 34f293bdf |
14213004255 has 32 divisors (see below), whose sum is σ = 26138865600. Its totient is φ = 7318878336.
The previous prime is 14213004251. The next prime is 14213004259. The reversal of 14213004255 is 55240031241.
It is an interprime number because it is at equal distance from previous prime (14213004251) and next prime (14213004259).
It is not a de Polignac number, because 14213004255 - 22 = 14213004251 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14213004251) 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, 1811284 + ... + 1819113.
It is an arithmetic number, because the mean of its divisors is an integer number (816839550).
Almost surely, 214213004255 is an apocalyptic number.
14213004255 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
14213004255 is a deficient number, since it is larger than the sum of its proper divisors (11925861345).
14213004255 is a wasteful number, since it uses less digits than its factorization.
14213004255 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3630440 (or 3630434 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
Adding to 14213004255 its reverse (55240031241), we get a palindrome (69453035496).
The spelling of 14213004255 in words is "fourteen billion, two hundred thirteen million, four thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •