Base | Representation |
---|---|
bin | 1000111000001100000… |
… | …11101100110110111000 |
3 | 1002011101001200121020020 |
4 | 10130012003230312320 |
5 | 14444212320431410 |
6 | 352045130130440 |
7 | 31016165602656 |
oct | 4340603546670 |
9 | 1064331617206 |
10 | 305044311480 |
11 | 10840661a167 |
12 | 4b152880a20 |
13 | 229c4c035bc |
14 | 10a9b059dd6 |
15 | 7e05469a70 |
hex | 47060ecdb8 |
305044311480 has 128 divisors (see below), whose sum is σ = 945263278080. Its totient is φ = 78670287360.
The previous prime is 305044311479. The next prime is 305044311541. The reversal of 305044311480 is 84113440503.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5915167 + ... + 5966513.
It is an arithmetic number, because the mean of its divisors is an integer number (7384869360).
Almost surely, 2305044311480 is an apocalyptic number.
305044311480 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 305044311480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (472631639040).
305044311480 is an abundant number, since it is smaller than the sum of its proper divisors (640218966600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
305044311480 is a wasteful number, since it uses less digits than its factorization.
305044311480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52989 (or 52985 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 33.
Adding to 305044311480 its reverse (84113440503), we get a palindrome (389157751983).
The spelling of 305044311480 in words is "three hundred five billion, forty-four million, three hundred eleven thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •