Base | Representation |
---|---|
bin | 101011111100010010101… |
… | …000111001101010100010 |
3 | 101200200022022201122200220 |
4 | 223330102220321222202 |
5 | 343433243212032210 |
6 | 10231115221023510 |
7 | 431110232424360 |
oct | 53742250715242 |
9 | 11620268648626 |
10 | 3019674720930 |
11 | a6470072581a |
12 | 409296b54b96 |
13 | 18b9a59c87ca |
14 | a621dd08630 |
15 | 53836b5ac70 |
hex | 2bf12a39aa2 |
3019674720930 has 256 divisors, whose sum is σ = 8967536455680. Its totient is φ = 635361656832.
The previous prime is 3019674720917. The next prime is 3019674720941. The reversal of 3019674720930 is 390274769103.
3019674720930 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 33067414 + ... + 33158606.
It is an arithmetic number, because the mean of its divisors is an integer number (35029439280).
Almost surely, 23019674720930 is an apocalyptic number.
3019674720930 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 3019674720930, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4483768227840).
3019674720930 is an abundant number, since it is smaller than the sum of its proper divisors (5947861734750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3019674720930 is a wasteful number, since it uses less digits than its factorization.
3019674720930 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91465.
The product of its (nonzero) digits is 1714608, while the sum is 51.
The spelling of 3019674720930 in words is "three trillion, nineteen billion, six hundred seventy-four million, seven hundred twenty thousand, nine hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •