Base | Representation |
---|---|
bin | 101010000111100… |
… | …1000111111110001 |
3 | 10122111021210121110 |
4 | 1110033020333301 |
5 | 10343243131103 |
6 | 352122543533 |
7 | 50010320262 |
oct | 12417107761 |
9 | 3574253543 |
10 | 1413255153 |
11 | 665822572 |
12 | 335367ba9 |
13 | 196a3cb6b |
14 | d59a2969 |
15 | 84112403 |
hex | 543c8ff1 |
1413255153 has 8 divisors (see below), whose sum is σ = 1884566016. Its totient is φ = 942057200.
The previous prime is 1413255139. The next prime is 1413255161. The reversal of 1413255153 is 3515523141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1413255153 - 25 = 1413255121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1413255153.
It is not an unprimeable number, because it can be changed into a prime (1413255113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7408 + ... + 53678.
It is an arithmetic number, because the mean of its divisors is an integer number (235570752).
Almost surely, 21413255153 is an apocalyptic number.
It is an amenable number.
1413255153 is a deficient number, since it is larger than the sum of its proper divisors (471310863).
1413255153 is a wasteful number, since it uses less digits than its factorization.
1413255153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56455.
The product of its digits is 9000, while the sum is 30.
The square root of 1413255153 is about 37593.2860096055. The cubic root of 1413255153 is about 1122.2084276668.
Adding to 1413255153 its reverse (3515523141), we get a palindrome (4928778294).
The spelling of 1413255153 in words is "one billion, four hundred thirteen million, two hundred fifty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •