Base | Representation |
---|---|
bin | 1001101110111111… |
… | …0101011100000101 |
3 | 20202002211120022000 |
4 | 2123233311130011 |
5 | 20322412230013 |
6 | 1111141455513 |
7 | 121516126341 |
oct | 23357653405 |
9 | 6662746260 |
10 | 2613008133 |
11 | 1120a7a75a |
12 | 60b111599 |
13 | 328478a78 |
14 | 1ab06a621 |
15 | 1045ee973 |
hex | 9bbf5705 |
2613008133 has 32 divisors (see below), whose sum is σ = 3999790080. Its totient is φ = 1684897200.
The previous prime is 2613008131. The next prime is 2613008207. The reversal of 2613008133 is 3318003162.
It is a happy number.
It is not a de Polignac number, because 2613008133 - 21 = 2613008131 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 2613008097 and 2613008106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2613008131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 108658 + ... + 130508.
It is an arithmetic number, because the mean of its divisors is an integer number (124993440).
Almost surely, 22613008133 is an apocalyptic number.
It is an amenable number.
2613008133 is a deficient number, since it is larger than the sum of its proper divisors (1386781947).
2613008133 is a wasteful number, since it uses less digits than its factorization.
2613008133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22006 (or 22000 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 2613008133 is about 51117.5912284607. The cubic root of 2613008133 is about 1377.3582684712.
The spelling of 2613008133 in words is "two billion, six hundred thirteen million, eight thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •