Base | Representation |
---|---|
bin | 1000111000001110110… |
… | …00011001001100000000 |
3 | 1002011102121110120012101 |
4 | 10130013120121030000 |
5 | 14444234011410102 |
6 | 352051242040144 |
7 | 31016555401612 |
oct | 4340730311400 |
9 | 1064377416171 |
10 | 305066513152 |
11 | 108418103655 |
12 | 4b15a1a9054 |
13 | 229c96a7b9b |
14 | 10a9dd98db2 |
15 | 7e073a2e87 |
hex | 4707619300 |
305066513152 has 72 divisors (see below), whose sum is σ = 625624503056. Its totient is φ = 148357287936.
The previous prime is 305066513117. The next prime is 305066513161. The reversal of 305066513152 is 251315660503.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43596118 + ... + 43603114.
Almost surely, 2305066513152 is an apocalyptic number.
305066513152 is a gapful number since it is divisible by the number (32) 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 305066513152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (312812251528).
305066513152 is an abundant number, since it is smaller than the sum of its proper divisors (320557989904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
305066513152 is an equidigital number, since it uses as much as digits as its factorization.
305066513152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11653 (or 11639 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 37.
The spelling of 305066513152 in words is "three hundred five billion, sixty-six million, five hundred thirteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •