Base | Representation |
---|---|
bin | 1011001011100110… |
… | …0001000010000000 |
3 | 21202011201000220000 |
4 | 2302321201002000 |
5 | 22121331000302 |
6 | 1213454520000 |
7 | 134243444214 |
oct | 26271410200 |
9 | 7664630800 |
10 | 3001421952 |
11 | 1300251811 |
12 | 6b9206000 |
13 | 38aa91829 |
14 | 206896944 |
15 | 12877531c |
hex | b2e61080 |
3001421952 has 80 divisors (see below), whose sum is σ = 8932213950. Its totient is φ = 1000470528.
The previous prime is 3001421947. The next prime is 3001421971. The reversal of 3001421952 is 2591241003.
It can be written as a sum of positive squares in only one way, i.e., 2970686016 + 30735936 = 54504^2 + 5544^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
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 9 ways as a sum of consecutive naturals, for example, 134377 + ... + 155112.
Almost surely, 23001421952 is an apocalyptic number.
3001421952 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
3001421952 is an abundant number, since it is smaller than the sum of its proper divisors (5930791998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3001421952 is an equidigital number, since it uses as much as digits as its factorization.
3001421952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289515 (or 289494 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 3001421952 is about 54785.2347991683. The cubic root of 3001421952 is about 1442.4774020551.
Adding to 3001421952 its reverse (2591241003), we get a palindrome (5592662955).
The spelling of 3001421952 in words is "three billion, one million, four hundred twenty-one thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •