Base | Representation |
---|---|
bin | 1110101110110011100… |
… | …0010001000100000000 |
3 | 220012020201221201001012 |
4 | 3223230320101010000 |
5 | 13121303030313341 |
6 | 312133035300052 |
7 | 24166420565306 |
oct | 3535470210400 |
9 | 805221851035 |
10 | 253082276096 |
11 | 9837138a971 |
12 | 410708aa628 |
13 | 1ab3381c7c0 |
14 | c36bd14276 |
15 | 68b37110eb |
hex | 3aece11100 |
253082276096 has 72 divisors (see below), whose sum is σ = 549027577560. Its totient is φ = 115735412736.
The previous prime is 253082276093. The next prime is 253082276123. The reversal of 253082276096 is 690672280352.
It can be written as a sum of positive squares in 4 ways, for example, as 30298276096 + 222784000000 = 174064^2 + 472000^2 .
It is not an unprimeable number, because it can be changed into a prime (253082276093) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13916 + ... + 711588.
Almost surely, 2253082276096 is an apocalyptic number.
253082276096 is a gapful number since it is divisible by the number (26) 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 253082276096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (274513788780).
253082276096 is an abundant number, since it is smaller than the sum of its proper divisors (295945301464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
253082276096 is a wasteful number, since it uses less digits than its factorization.
253082276096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697811 (or 697797 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 50.
The spelling of 253082276096 in words is "two hundred fifty-three billion, eighty-two million, two hundred seventy-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •