Base | Representation |
---|---|
bin | 11100100101100101… |
… | …111000100110111001 |
3 | 2221020012220220010101 |
4 | 130211211320212321 |
5 | 1000331014144012 |
6 | 22033514115401 |
7 | 2134443045601 |
oct | 344545704671 |
9 | 87205826111 |
10 | 30695459257 |
11 | 12021871951 |
12 | 5b47a1bb61 |
13 | 2b824a4758 |
14 | 16b295dc01 |
15 | be9c00d57 |
hex | 7259789b9 |
30695459257 has 8 divisors (see below), whose sum is σ = 30985999200. Its totient is φ = 30404987424.
The previous prime is 30695459129. The next prime is 30695459279. The reversal of 30695459257 is 75295459603.
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 30695459257 - 27 = 30695459129 is a prime.
It is a super-2 number, since 2×306954592572 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30695459198 and 30695459207.
It is not an unprimeable number, because it can be changed into a prime (30695459287) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1687869 + ... + 1705957.
It is an arithmetic number, because the mean of its divisors is an integer number (3873249900).
Almost surely, 230695459257 is an apocalyptic number.
It is an amenable number.
30695459257 is a deficient number, since it is larger than the sum of its proper divisors (290539943).
30695459257 is a wasteful number, since it uses less digits than its factorization.
30695459257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34055.
The product of its (nonzero) digits is 10206000, while the sum is 55.
The spelling of 30695459257 in words is "thirty billion, six hundred ninety-five million, four hundred fifty-nine thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •