Base | Representation |
---|---|
bin | 111011111111111… |
… | …1111110110110100 |
3 | 12012022022110211200 |
4 | 1313333333312310 |
5 | 13110343442312 |
6 | 531435132500 |
7 | 100614321141 |
oct | 16777776664 |
9 | 5168273750 |
10 | 2013265332 |
11 | 943488051 |
12 | 4822a4130 |
13 | 261140280 |
14 | 15154d3c8 |
15 | bbb330dc |
hex | 77fffdb4 |
2013265332 has 72 divisors (see below), whose sum is σ = 5608066464. Its totient is φ = 605054016.
The previous prime is 2013265301. The next prime is 2013265343. The reversal of 2013265332 is 2335623102.
2013265332 is a `hidden beast` number, since 2 + 0 + 1 + 3 + 2 + 653 + 3 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 2013265296 and 2013265305.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 29898 + ... + 70145.
It is an arithmetic number, because the mean of its divisors is an integer number (77889812).
Almost surely, 22013265332 is an apocalyptic number.
It is an amenable number.
2013265332 is an abundant number, since it is smaller than the sum of its proper divisors (3594801132).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2013265332 is a wasteful number, since it uses less digits than its factorization.
2013265332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100109 (or 100104 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
The square root of 2013265332 is about 44869.4253584777. The cubic root of 2013265332 is about 1262.7004591279.
Adding to 2013265332 its reverse (2335623102), we get a palindrome (4348888434).
It can be divided in two parts, 20132653 and 32, that added together give a triangular number (20132685 = T6345).
The spelling of 2013265332 in words is "two billion, thirteen million, two hundred sixty-five thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •