Base | Representation |
---|---|
bin | 100101001001110001110… |
… | …100000101001110110111 |
3 | 100001002001022210210202112 |
4 | 211021301310011032313 |
5 | 313312242213132101 |
6 | 5232515343201235 |
7 | 352312460242214 |
oct | 45116164051667 |
9 | 10032038723675 |
10 | 2553120052151 |
11 | 8a4854789729 |
12 | 35298a8a621b |
13 | 1569b197ac66 |
14 | 8b80093ab0b |
15 | 4662c3606bb |
hex | 25271d053b7 |
2553120052151 has 8 divisors (see below), whose sum is σ = 2582069554800. Its totient is φ = 2524176388800.
The previous prime is 2553120052127. The next prime is 2553120052163. The reversal of 2553120052151 is 1512500213552.
2553120052151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2553120052151 - 230 = 2552046310327 is a prime.
It is a super-3 number, since 3×25531200521513 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2553120052051) 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, 577400 + ... + 2332301.
It is an arithmetic number, because the mean of its divisors is an integer number (322758694350).
Almost surely, 22553120052151 is an apocalyptic number.
2553120052151 is a deficient number, since it is larger than the sum of its proper divisors (28949502649).
2553120052151 is an equidigital number, since it uses as much as digits as its factorization.
2553120052151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2919649.
The product of its (nonzero) digits is 15000, while the sum is 32.
The spelling of 2553120052151 in words is "two trillion, five hundred fifty-three billion, one hundred twenty million, fifty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •