Base | Representation |
---|---|
bin | 111100000011110… |
… | …0011011011110000 |
3 | 12012110001002220010 |
4 | 1320013203123300 |
5 | 13111400333224 |
6 | 531545414520 |
7 | 100640210646 |
oct | 17007433360 |
9 | 5173032803 |
10 | 2015246064 |
11 | 944610217 |
12 | 482a9a440 |
13 | 2616849c0 |
14 | 151907196 |
15 | bbdc4e29 |
hex | 781e36f0 |
2015246064 has 80 divisors (see below), whose sum is σ = 5658144800. Its totient is φ = 614366208.
The previous prime is 2015246053. The next prime is 2015246071. The reversal of 2015246064 is 4606425102.
It is a super-2 number, since 2×20152460642 = 8122433396934984192, which contains 22 as substring.
It is a congruent number.
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, 53202 + ... + 82830.
It is an arithmetic number, because the mean of its divisors is an integer number (70726810).
Almost surely, 22015246064 is an apocalyptic number.
2015246064 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2015246064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2829072400).
2015246064 is an abundant number, since it is smaller than the sum of its proper divisors (3642898736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2015246064 is a wasteful number, since it uses less digits than its factorization.
2015246064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29762 (or 29756 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
The square root of 2015246064 is about 44891.4921115349. The cubic root of 2015246064 is about 1263.1144220229.
The spelling of 2015246064 in words is "two billion, fifteen million, two hundred forty-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •