Base | Representation |
---|---|
bin | 1001110111100101… |
… | …1110100001001000 |
3 | 20211121201201110220 |
4 | 2131321132201020 |
5 | 20411131340440 |
6 | 1114511110040 |
7 | 122434615545 |
oct | 23571364110 |
9 | 6747651426 |
10 | 2649090120 |
11 | 113a384686 |
12 | 61b212320 |
13 | 332aa0161 |
14 | 1b1b7dbcc |
15 | 10787a8d0 |
hex | 9de5e848 |
2649090120 has 64 divisors (see below), whose sum is σ = 8203645440. Its totient is φ = 683635200.
The previous prime is 2649090097. The next prime is 2649090133. The reversal of 2649090120 is 210909462.
2649090120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×26490901202 = 14035356927763228800, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 352341 + ... + 359780.
It is an arithmetic number, because the mean of its divisors is an integer number (128181960).
Almost surely, 22649090120 is an apocalyptic number.
2649090120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2649090120 is an abundant number, since it is smaller than the sum of its proper divisors (5554555320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2649090120 is a wasteful number, since it uses less digits than its factorization.
2649090120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 712166 (or 712162 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 33.
The square root of 2649090120 is about 51469.3124104063. The cubic root of 2649090120 is about 1383.6691060215.
Adding to 2649090120 its reverse (210909462), we get a palindrome (2859999582).
The spelling of 2649090120 in words is "two billion, six hundred forty-nine million, ninety thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •