Base | Representation |
---|---|
bin | 111101101010101… |
… | …1001001000000000 |
3 | 12100012120112022220 |
4 | 1323111121020000 |
5 | 13214204034004 |
6 | 541154131040 |
7 | 102163646052 |
oct | 17325311000 |
9 | 5305515286 |
10 | 2069205504 |
11 | 9720157a3 |
12 | 498b80a80 |
13 | 26c8c8372 |
14 | 158b518d2 |
15 | c19d2dd9 |
hex | 7b559200 |
2069205504 has 80 divisors (see below), whose sum is σ = 5523610752. Its totient is φ = 688345088.
The previous prime is 2069205499. The next prime is 2069205527. The reversal of 2069205504 is 4055029602.
It is a super-2 number, since 2×20692055042 = 8563222835567788032, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1001977 + ... + 1004039.
Almost surely, 22069205504 is an apocalyptic number.
2069205504 is a gapful number since it is divisible by the number (24) 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 2069205504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2761805376).
2069205504 is an abundant number, since it is smaller than the sum of its proper divisors (3454405248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2069205504 is an equidigital number, since it uses as much as digits as its factorization.
2069205504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2737 (or 2721 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
The square root of 2069205504 is about 45488.5205738767. The cubic root of 2069205504 is about 1274.2888263072.
The spelling of 2069205504 in words is "two billion, sixty-nine million, two hundred five thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •