Base | Representation |
---|---|
bin | 11100100111010010… |
… | …011011111001011001 |
3 | 2221022012110121112212 |
4 | 130213102123321121 |
5 | 1000410310242403 |
6 | 22040412044505 |
7 | 2135236654145 |
oct | 344722337131 |
9 | 87265417485 |
10 | 30723915353 |
11 | 1203693838a |
12 | 5b55463735 |
13 | 2b88358a91 |
14 | 16b664a225 |
15 | bec4724d8 |
hex | 72749be59 |
30723915353 has 8 divisors (see below), whose sum is σ = 31795005000. Its totient is φ = 29653602048.
The previous prime is 30723915319. The next prime is 30723915371. The reversal of 30723915353 is 35351932703.
It can be written as a sum of positive squares in 4 ways, for example, as 115713049 + 30608202304 = 10757^2 + 174952^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30723915353 - 26 = 30723915289 is a prime.
It is a super-2 number, since 2×307239153532 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30723915353.
It is not an unprimeable number, because it can be changed into a prime (30723912353) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 112976 + ... + 272417.
It is an arithmetic number, because the mean of its divisors is an integer number (3974375625).
Almost surely, 230723915353 is an apocalyptic number.
It is an amenable number.
30723915353 is a deficient number, since it is larger than the sum of its proper divisors (1071089647).
30723915353 is a wasteful number, since it uses less digits than its factorization.
30723915353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 388171.
The product of its (nonzero) digits is 255150, while the sum is 41.
The spelling of 30723915353 in words is "thirty billion, seven hundred twenty-three million, nine hundred fifteen thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •