Base | Representation |
---|---|
bin | 1011011010100000… |
… | …1111011110110000 |
3 | 21220112110110020100 |
4 | 2312220033132300 |
5 | 22233341034410 |
6 | 1224012112400 |
7 | 135633406560 |
oct | 26650173660 |
9 | 7815413210 |
10 | 3064002480 |
11 | 1332605460 |
12 | 716165700 |
13 | 39aa33226 |
14 | 210d06da0 |
15 | 12ded78c0 |
hex | b6a0f7b0 |
3064002480 has 480 divisors, whose sum is σ = 13587844608. Its totient is φ = 599040000.
The previous prime is 3064002467. The next prime is 3064002499. The reversal of 3064002480 is 842004603.
It is a super-2 number, since 2×30640024802 = 18776222394892300800, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 940855 + ... + 944105.
Almost surely, 23064002480 is an apocalyptic number.
3064002480 is a gapful number since it is divisible by the number (30) 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 3064002480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6793922304).
3064002480 is an abundant number, since it is smaller than the sum of its proper divisors (10523842128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3064002480 is a wasteful number, since it uses less digits than its factorization.
3064002480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3305 (or 3296 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The square root of 3064002480 is about 55353.4324138982. The cubic root of 3064002480 is about 1452.4338798538.
The spelling of 3064002480 in words is "three billion, sixty-four million, two thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •