Base | Representation |
---|---|
bin | 111100111001010… |
… | …1000010100000000 |
3 | 12021101212011212020 |
4 | 1321302220110000 |
5 | 13141042043311 |
6 | 534431201440 |
7 | 101430615630 |
oct | 17162502400 |
9 | 5241764766 |
10 | 2043315456 |
11 | 959442166 |
12 | 490376280 |
13 | 267432000 |
14 | 1555326c0 |
15 | be5bbc06 |
hex | 79ca8500 |
2043315456 has 288 divisors, whose sum is σ = 6771690240. Its totient is φ = 535781376.
The previous prime is 2043315419. The next prime is 2043315457. The reversal of 2043315456 is 6545133402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2043315457) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11810986 + ... + 11811158.
Almost surely, 22043315456 is an apocalyptic number.
2043315456 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2043315456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3385845120).
2043315456 is an abundant number, since it is smaller than the sum of its proper divisors (4728374784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2043315456 is an equidigital number, since it uses as much as digits as its factorization.
2043315456 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238 (or 198 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 33.
The square root of 2043315456 is about 45203.0469769461. The cubic root of 2043315456 is about 1268.9518406474.
Adding to 2043315456 its reverse (6545133402), we get a palindrome (8588448858).
The spelling of 2043315456 in words is "two billion, forty-three million, three hundred fifteen thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •