Base | Representation |
---|---|
bin | 100101001010100111110… |
… | …000111100110110000000 |
3 | 100001011101102000010120212 |
4 | 211022213300330312000 |
5 | 313321120422413044 |
6 | 5233145235453252 |
7 | 352344061004213 |
oct | 45124760746600 |
9 | 10034342003525 |
10 | 2554025201024 |
11 | 8a5179708450 |
12 | 352ba1a57228 |
13 | 156ac73580cb |
14 | 8b888c3777a |
15 | 46681a57a9e |
hex | 252a7c3cd80 |
2554025201024 has 64 divisors (see below), whose sum is σ = 5561776440000. Its totient is φ = 1158593733120.
The previous prime is 2554025201017. The next prime is 2554025201033. The reversal of 2554025201024 is 4201025204552.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×25540252010242 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1114982 + ... + 2520165.
It is an arithmetic number, because the mean of its divisors is an integer number (86902756875).
Almost surely, 22554025201024 is an apocalyptic number.
It is an amenable number.
2554025201024 is an abundant number, since it is smaller than the sum of its proper divisors (3007751238976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2554025201024 is a wasteful number, since it uses less digits than its factorization.
2554025201024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3635671 (or 3635659 counting only the distinct ones).
The product of its (nonzero) digits is 32000, while the sum is 32.
The spelling of 2554025201024 in words is "two trillion, five hundred fifty-four billion, twenty-five million, two hundred one thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •