Base | Representation |
---|---|
bin | 1000110100110101001… |
… | …00101100011011010100 |
3 | 1001222201101110221221010 |
4 | 10122122210230123110 |
5 | 14432014200134030 |
6 | 351150151252220 |
7 | 30623411102511 |
oct | 4323244543324 |
9 | 1058641427833 |
10 | 303241021140 |
11 | 107670718472 |
12 | 4a92a97a070 |
13 | 227984309b5 |
14 | 10969768308 |
15 | 7d4beb16b0 |
hex | 469a92c6d4 |
303241021140 has 96 divisors (see below), whose sum is σ = 867688303104. Its totient is φ = 79093739520.
The previous prime is 303241021123. The next prime is 303241021177. The reversal of 303241021140 is 41120142303.
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, 4538052 + ... + 4604388.
It is an arithmetic number, because the mean of its divisors is an integer number (9038419824).
Almost surely, 2303241021140 is an apocalyptic number.
303241021140 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 303241021140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (433844151552).
303241021140 is an abundant number, since it is smaller than the sum of its proper divisors (564447281964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
303241021140 is a wasteful number, since it uses less digits than its factorization.
303241021140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68017 (or 68015 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 303241021140 its reverse (41120142303), we get a palindrome (344361163443).
The spelling of 303241021140 in words is "three hundred three billion, two hundred forty-one million, twenty-one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •