Base | Representation |
---|---|
bin | 101101010100001… |
… | …0001110001000000 |
3 | 10220222002210210221 |
4 | 1122220101301000 |
5 | 11103222223333 |
6 | 410513432424 |
7 | 52452050560 |
oct | 13250216100 |
9 | 3828083727 |
10 | 1520507968 |
11 | 710318161 |
12 | 36526b714 |
13 | 1b3022975 |
14 | 105d20da0 |
15 | 8d74ad2d |
hex | 5aa11c40 |
1520507968 has 56 divisors (see below), whose sum is σ = 3456432000. Its totient is φ = 650108928.
The previous prime is 1520507957. The next prime is 1520507977. The reversal of 1520507968 is 8697050251.
It is a tau number, because it is divible by the number of its divisors (56).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 197373 + ... + 204931.
It is an arithmetic number, because the mean of its divisors is an integer number (61722000).
Almost surely, 21520507968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1520507968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1728216000).
1520507968 is an abundant number, since it is smaller than the sum of its proper divisors (1935924032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1520507968 is an equidigital number, since it uses as much as digits as its factorization.
1520507968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8027 (or 8017 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 43.
The square root of 1520507968 is about 38993.6913871975. The cubic root of 1520507968 is about 1149.9074829164.
The spelling of 1520507968 in words is "one billion, five hundred twenty million, five hundred seven thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •