Base | Representation |
---|---|
bin | 1110110000111011001… |
… | …0010001101010101100 |
3 | 220020201101100112100021 |
4 | 3230032302101222230 |
5 | 13123434142143202 |
6 | 312305320011524 |
7 | 24216466016464 |
oct | 3541662215254 |
9 | 806641315307 |
10 | 253651131052 |
11 | 986334a6030 |
12 | 411ab300ba4 |
13 | 1abc4632177 |
14 | c3c36b0ba4 |
15 | 68e862aa37 |
hex | 3b0ec91aac |
253651131052 has 12 divisors (see below), whose sum is σ = 484243068456. Its totient is φ = 115295968640.
The previous prime is 253651131047. The next prime is 253651131053. The reversal of 253651131052 is 250131156352.
253651131052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 253651130999 and 253651131017.
It is not an unprimeable number, because it can be changed into a prime (253651131053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2882399173 + ... + 2882399260.
It is an arithmetic number, because the mean of its divisors is an integer number (40353589038).
Almost surely, 2253651131052 is an apocalyptic number.
253651131052 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
253651131052 is a deficient number, since it is larger than the sum of its proper divisors (230591937404).
253651131052 is a wasteful number, since it uses less digits than its factorization.
253651131052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5764798448 (or 5764798446 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 34.
The spelling of 253651131052 in words is "two hundred fifty-three billion, six hundred fifty-one million, one hundred thirty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •