Base | Representation |
---|---|
bin | 11110001010111… |
… | …01111100101100 |
3 | 122122020101110000 |
4 | 33011131330230 |
5 | 1004242413003 |
6 | 41040344300 |
7 | 6162146316 |
oct | 1705357454 |
9 | 578211400 |
10 | 253091628 |
11 | 11a955539 |
12 | 70915090 |
13 | 4058597a |
14 | 258827b6 |
15 | 173451a3 |
hex | f15df2c |
253091628 has 60 divisors (see below), whose sum is σ = 696471160. Its totient is φ = 79921728.
The previous prime is 253091621. The next prime is 253091639. The reversal of 253091628 is 826190352.
253091628 is a `hidden beast` number, since 25 + 3 + 0 + 9 + 1 + 628 = 666.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 253091592 and 253091601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253091621) 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 19 ways as a sum of consecutive naturals, for example, 14401 + ... + 26712.
Almost surely, 2253091628 is an apocalyptic number.
It is an amenable number.
253091628 is an abundant number, since it is smaller than the sum of its proper divisors (443379532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
253091628 is a wasteful number, since it uses less digits than its factorization.
253091628 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41148 (or 41137 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 253091628 is about 15908.8537613494. The cubic root of 253091628 is about 632.5466982139.
The spelling of 253091628 in words is "two hundred fifty-three million, ninety-one thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •