Base | Representation |
---|---|
bin | 1000011101100101010101… |
… | …0110100111011100101010 |
3 | 1012221111002211120100010120 |
4 | 2013121111112213130222 |
5 | 2204420232233431432 |
6 | 31442203431224110 |
7 | 1650133666623444 |
oct | 207312526473452 |
9 | 35844084510116 |
10 | 9304331155242 |
11 | 2a67a43412472 |
12 | 10632a9818036 |
13 | 5265190c8846 |
14 | 242491141494 |
15 | 112061225c2c |
hex | 876555a772a |
9304331155242 has 8 divisors (see below), whose sum is σ = 18608662310496. Its totient is φ = 3101443718412.
The previous prime is 9304331155241. The next prime is 9304331155277. The reversal of 9304331155242 is 2425511334039.
It is a sphenic number, since it is the product of 3 distinct primes.
9304331155242 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 9304331155194 and 9304331155203.
It is not an unprimeable number, because it can be changed into a prime (9304331155241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 775360929598 + ... + 775360929609.
It is an arithmetic number, because the mean of its divisors is an integer number (2326082788812).
Almost surely, 29304331155242 is an apocalyptic number.
9304331155242 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
9304331155242 is a wasteful number, since it uses less digits than its factorization.
9304331155242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1550721859212.
The product of its (nonzero) digits is 388800, while the sum is 42.
The spelling of 9304331155242 in words is "nine trillion, three hundred four billion, three hundred thirty-one million, one hundred fifty-five thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •