Base | Representation |
---|---|
bin | 11110001100100… |
… | …10000100011101 |
3 | 122122122020022000 |
4 | 33012102010131 |
5 | 1004321230432 |
6 | 41045112513 |
7 | 6164025612 |
oct | 1706220435 |
9 | 578566260 |
10 | 253305117 |
11 | 11aa9097a |
12 | 709b8739 |
13 | 4062bbb0 |
14 | 258da509 |
15 | 1738857c |
hex | f19211d |
253305117 has 32 divisors (see below), whose sum is σ = 427916160. Its totient is φ = 146707200.
The previous prime is 253305103. The next prime is 253305133. The reversal of 253305117 is 711503352.
It is not a de Polignac number, because 253305117 - 224 = 236527901 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 (253305197) 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, 15259 + ... + 27192.
It is an arithmetic number, because the mean of its divisors is an integer number (13372380).
Almost surely, 2253305117 is an apocalyptic number.
253305117 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
It is an amenable number.
253305117 is a deficient number, since it is larger than the sum of its proper divisors (174611043).
253305117 is a wasteful number, since it uses less digits than its factorization.
253305117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42490 (or 42484 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 27.
The square root of 253305117 is about 15915.5621012894. The cubic root of 253305117 is about 632.7245044502.
Adding to 253305117 its reverse (711503352), we get a palindrome (964808469).
The spelling of 253305117 in words is "two hundred fifty-three million, three hundred five thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •