Base | Representation |
---|---|
bin | 1011010000000011… |
… | …0010001110110010 |
3 | 21210110212012200220 |
4 | 2310000302032302 |
5 | 22141121322001 |
6 | 1215403153510 |
7 | 134561315520 |
oct | 26400621662 |
9 | 7713765626 |
10 | 3020104626 |
11 | 130a852340 |
12 | 703515896 |
13 | 391903476 |
14 | 20915b310 |
15 | 12a215c36 |
hex | b40323b2 |
3020104626 has 128 divisors (see below), whose sum is σ = 7741163520. Its totient is φ = 762816000.
The previous prime is 3020104609. The next prime is 3020104651. The reversal of 3020104626 is 6264010203.
It is a junction number, because it is equal to n+sod(n) for n = 3020104596 and 3020104605.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2752510 + ... + 2753606.
It is an arithmetic number, because the mean of its divisors is an integer number (60477840).
Almost surely, 23020104626 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3020104626, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3870581760).
3020104626 is an abundant number, since it is smaller than the sum of its proper divisors (4721058894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3020104626 is a wasteful number, since it uses less digits than its factorization.
3020104626 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1280.
The product of its (nonzero) digits is 1728, while the sum is 24.
The square root of 3020104626 is about 54955.4785803927. The cubic root of 3020104626 is about 1445.4641654077.
Adding to 3020104626 its reverse (6264010203), we get a palindrome (9284114829).
The spelling of 3020104626 in words is "three billion, twenty million, one hundred four thousand, six hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •