Base | Representation |
---|---|
bin | 11011111101111110… |
… | …011110000110110101 |
3 | 2212111220021111112012 |
4 | 123331332132012311 |
5 | 443000342100134 |
6 | 21443532334005 |
7 | 2112122502311 |
oct | 337576360665 |
9 | 85456244465 |
10 | 30030815669 |
11 | 11810681328 |
12 | 59a1314305 |
13 | 2aa789441a |
14 | 164c58ab41 |
15 | bab6b46ce |
hex | 6fdf9e1b5 |
30030815669 has 4 divisors (see below), whose sum is σ = 30139230444. Its totient is φ = 29922400896.
The previous prime is 30030815621. The next prime is 30030815671. The reversal of 30030815669 is 96651803003.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 96651803003 = 7 ⋅13807400429.
It can be written as a sum of positive squares in 2 ways, for example, as 18519671569 + 11511144100 = 136087^2 + 107290^2 .
It is a cyclic number.
It is not a de Polignac number, because 30030815669 - 28 = 30030815413 is a prime.
It is a super-2 number, since 2×300308156692 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30030815609) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54206972 + ... + 54207525.
It is an arithmetic number, because the mean of its divisors is an integer number (7534807611).
Almost surely, 230030815669 is an apocalyptic number.
It is an amenable number.
30030815669 is a deficient number, since it is larger than the sum of its proper divisors (108414775).
30030815669 is a wasteful number, since it uses less digits than its factorization.
30030815669 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108414774.
The product of its (nonzero) digits is 116640, while the sum is 41.
The spelling of 30030815669 in words is "thirty billion, thirty million, eight hundred fifteen thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •