Base | Representation |
---|---|
bin | 1001111001010000… |
… | …1100100011110000 |
3 | 20212002220120121110 |
4 | 2132110030203300 |
5 | 20414430010243 |
6 | 1115321153320 |
7 | 122551300410 |
oct | 23624144360 |
9 | 6762816543 |
10 | 2656094448 |
11 | 1143329087 |
12 | 62162b840 |
13 | 334383327 |
14 | 1b2a84640 |
15 | 1082b0e33 |
hex | 9e50c8f0 |
2656094448 has 40 divisors (see below), whose sum is σ = 7841803648. Its totient is φ = 758884032.
The previous prime is 2656094447. The next prime is 2656094521. The reversal of 2656094448 is 8444906562.
It is a super-3 number, since 3×26560944483 (a number of 29 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 2656094397 and 2656094406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2656094447) 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, 3952186 + ... + 3952857.
Almost surely, 22656094448 is an apocalyptic number.
2656094448 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
2656094448 is an abundant number, since it is smaller than the sum of its proper divisors (5185709200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2656094448 is a wasteful number, since it uses less digits than its factorization.
2656094448 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7905061 (or 7905055 counting only the distinct ones).
The product of its (nonzero) digits is 1658880, while the sum is 48.
The square root of 2656094448 is about 51537.3112220651. The cubic root of 2656094448 is about 1384.8875297810.
The spelling of 2656094448 in words is "two billion, six hundred fifty-six million, ninety-four thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •