Base | Representation |
---|---|
bin | 1110101110100001100… |
… | …1011000000000000000 |
3 | 220012001111102210120000 |
4 | 3223220121120000000 |
5 | 13121124302203214 |
6 | 312121351320000 |
7 | 24164515414212 |
oct | 3535031300000 |
9 | 805044383500 |
10 | 253007069184 |
11 | 983329928a1 |
12 | 4104b680000 |
13 | 1ab21079c7c |
14 | c361d385b2 |
15 | 68abd07809 |
hex | 3ae8658000 |
253007069184 has 640 divisors, whose sum is σ = 827864334000. Its totient is φ = 76695994368.
The previous prime is 253007069167. The next prime is 253007069219. The reversal of 253007069184 is 481960700352.
It is a congruent number.
It is an unprimeable number.
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 39 ways as a sum of consecutive naturals, for example, 1462468522 + ... + 1462468694.
It is a 1-persistent number, because it is pandigital, but 2⋅253007069184 = 506014138368 is not.
Almost surely, 2253007069184 is an apocalyptic number.
253007069184 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 253007069184, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (413932167000).
253007069184 is an abundant number, since it is smaller than the sum of its proper divisors (574857264816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
253007069184 is an equidigital number, since it uses as much as digits as its factorization.
253007069184 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263 (or 226 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The spelling of 253007069184 in words is "two hundred fifty-three billion, seven million, sixty-nine thousand, one hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •