Base | Representation |
---|---|
bin | 1011011010010011… |
… | …1100111111100010 |
3 | 21220110211122120120 |
4 | 2312210330333202 |
5 | 22233130442242 |
6 | 1223541421110 |
7 | 135623156154 |
oct | 26644747742 |
9 | 7813748516 |
10 | 3063140322 |
11 | 1332076730 |
12 | 715a0a796 |
13 | 39a7c0988 |
14 | 210b60ad4 |
15 | 12ddb71ec |
hex | b693cfe2 |
3063140322 has 64 divisors (see below), whose sum is σ = 7043189760. Its totient is φ = 879032000.
The previous prime is 3063140317. The next prime is 3063140357. The reversal of 3063140322 is 2230413603.
It is a junction number, because it is equal to n+sod(n) for n = 3063140292 and 3063140301.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 143329 + ... + 163307.
It is an arithmetic number, because the mean of its divisors is an integer number (110049840).
Almost surely, 23063140322 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3063140322, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3521594880).
3063140322 is an abundant number, since it is smaller than the sum of its proper divisors (3980049438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3063140322 is a wasteful number, since it uses less digits than its factorization.
3063140322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20119.
The product of its (nonzero) digits is 2592, while the sum is 24.
The square root of 3063140322 is about 55345.6441104447. The cubic root of 3063140322 is about 1452.2976370399.
Adding to 3063140322 its reverse (2230413603), we get a palindrome (5293553925).
The spelling of 3063140322 in words is "three billion, sixty-three million, one hundred forty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •