Base | Representation |
---|---|
bin | 11110001011111… |
… | …01010100011001 |
3 | 122122110220201000 |
4 | 33011331110121 |
5 | 1004311020441 |
6 | 41043215213 |
7 | 6163223040 |
oct | 1705752431 |
9 | 578426630 |
10 | 253220121 |
11 | 11aa33030 |
12 | 70977509 |
13 | 405cc2bb |
14 | 258b7557 |
15 | 1736d2b6 |
hex | f17d519 |
253220121 has 64 divisors (see below), whose sum is σ = 482918400. Its totient is φ = 127267200.
The previous prime is 253220111. The next prime is 253220131. The reversal of 253220121 is 121022352.
It is an interprime number because it is at equal distance from previous prime (253220111) and next prime (253220131).
It is not a de Polignac number, because 253220121 - 29 = 253219609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 253220094 and 253220103.
It is not an unprimeable number, because it can be changed into a prime (253220111) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 62485 + ... + 66413.
It is an arithmetic number, because the mean of its divisors is an integer number (7545600).
Almost surely, 2253220121 is an apocalyptic number.
253220121 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
253220121 is a deficient number, since it is larger than the sum of its proper divisors (229698279).
253220121 is a wasteful number, since it uses less digits than its factorization.
253220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3987 (or 3981 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 253220121 is about 15912.8916605374. The cubic root of 253220121 is about 632.6537267404.
Adding to 253220121 its reverse (121022352), we get a palindrome (374242473).
The spelling of 253220121 in words is "two hundred fifty-three million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •