Base | Representation |
---|---|
bin | 1001101101000101… |
… | …1101011001001001 |
3 | 20201112212000101001 |
4 | 2123101131121021 |
5 | 20313342422241 |
6 | 1110255055001 |
7 | 121361343214 |
oct | 23321353111 |
9 | 6645760331 |
10 | 2605045321 |
11 | 111753111a |
12 | 608511461 |
13 | 32691b548 |
14 | 1a9d9677b |
15 | 103a7a431 |
hex | 9b45d649 |
2605045321 has 16 divisors (see below), whose sum is σ = 2744913600. Its totient is φ = 2468692800.
The previous prime is 2605045301. The next prime is 2605045361. The reversal of 2605045321 is 1235405062.
2605045321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 2605045321 - 219 = 2604521033 is a prime.
It is a super-2 number, since 2×26050453212 = 13572522248927986082, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2605045321.
It is not an unprimeable number, because it can be changed into a prime (2605045301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1008810 + ... + 1011388.
It is an arithmetic number, because the mean of its divisors is an integer number (171557100).
Almost surely, 22605045321 is an apocalyptic number.
It is an amenable number.
2605045321 is a deficient number, since it is larger than the sum of its proper divisors (139868279).
2605045321 is a wasteful number, since it uses less digits than its factorization.
2605045321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3240.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 2605045321 is about 51039.6446010354. The cubic root of 2605045321 is about 1375.9577364501.
The spelling of 2605045321 in words is "two billion, six hundred five million, forty-five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •