Base | Representation |
---|---|
bin | 1000111101110011… |
… | …0101010001011000 |
3 | 20012201122000220111 |
4 | 2033130311101120 |
5 | 14412103400440 |
6 | 1034451534104 |
7 | 113432420266 |
oct | 21734652130 |
9 | 6181560814 |
10 | 2406700120 |
11 | 1025579470 |
12 | 571bba334 |
13 | 2c47c3516 |
14 | 18b8c5436 |
15 | e144b4ea |
hex | 8f735458 |
2406700120 has 32 divisors (see below), whose sum is σ = 5907355920. Its totient is φ = 875163520.
The previous prime is 2406700117. The next prime is 2406700139. The reversal of 2406700120 is 210076042.
2406700120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 2406700091 and 2406700100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2734447 + ... + 2735326.
Almost surely, 22406700120 is an apocalyptic number.
2406700120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2406700120 is an abundant number, since it is smaller than the sum of its proper divisors (3500655800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2406700120 is a wasteful number, since it uses less digits than its factorization.
2406700120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5469795 (or 5469791 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 22.
The square root of 2406700120 is about 49058.1300092044. The cubic root of 2406700120 is about 1340.1106539646.
Adding to 2406700120 its reverse (210076042), we get a palindrome (2616776162).
The spelling of 2406700120 in words is "two billion, four hundred six million, seven hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •