Base | Representation |
---|---|
bin | 1001011000110100… |
… | …1100101010101011 |
3 | 20111121220101221122 |
4 | 2112031030222223 |
5 | 20130112322110 |
6 | 1054021125455 |
7 | 116310001451 |
oct | 22615145253 |
9 | 6447811848 |
10 | 2520042155 |
11 | 1083552a74 |
12 | 5a3b5988b |
13 | 312128b07 |
14 | 19c98a9d1 |
15 | eb389255 |
hex | 9634caab |
2520042155 has 8 divisors (see below), whose sum is σ = 3024444192. Its totient is φ = 2015771328.
The previous prime is 2520042149. The next prime is 2520042157. The reversal of 2520042155 is 5512400252.
2520042155 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2520042155 - 28 = 2520041899 is a prime.
It is a super-3 number, since 3×25200421553 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2520042157) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16079 + ... + 72791.
It is an arithmetic number, because the mean of its divisors is an integer number (378055524).
Almost surely, 22520042155 is an apocalyptic number.
2520042155 is a deficient number, since it is larger than the sum of its proper divisors (504402037).
2520042155 is an equidigital number, since it uses as much as digits as its factorization.
2520042155 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65605.
The product of its (nonzero) digits is 4000, while the sum is 26.
The square root of 2520042155 is about 50200.0214641388. The cubic root of 2520042155 is about 1360.8260111511.
The spelling of 2520042155 in words is "two billion, five hundred twenty million, forty-two thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •