Base | Representation |
---|---|
bin | 100110010001110010110… |
… | …001011000010100011000 |
3 | 100022110122021100012102220 |
4 | 212101302301120110120 |
5 | 321044123024014230 |
6 | 5332224320424040 |
7 | 361020615053235 |
oct | 46216261302430 |
9 | 10273567305386 |
10 | 2630445532440 |
11 | 924624a22540 |
12 | 36596aa78020 |
13 | 16108597b01b |
14 | 914583d678c |
15 | 48655b2dd10 |
hex | 26472c58518 |
2630445532440 has 128 divisors (see below), whose sum is σ = 8905583750400. Its totient is φ = 615694661120.
The previous prime is 2630445532417. The next prime is 2630445532453. The reversal of 2630445532440 is 442355440362.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2630445532392 and 2630445532401.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 34319682 + ... + 34396241.
It is an arithmetic number, because the mean of its divisors is an integer number (69574873050).
Almost surely, 22630445532440 is an apocalyptic number.
2630445532440 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2630445532440 is an abundant number, since it is smaller than the sum of its proper divisors (6275138217960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2630445532440 is a wasteful number, since it uses less digits than its factorization.
2630445532440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68715977 (or 68715973 counting only the distinct ones).
The product of its (nonzero) digits is 1382400, while the sum is 42.
The spelling of 2630445532440 in words is "two trillion, six hundred thirty billion, four hundred forty-five million, five hundred thirty-two thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •