Base | Representation |
---|---|
bin | 11100010111101011… |
… | …100000101011001001 |
3 | 2220121221201122000121 |
4 | 130113223200223021 |
5 | 444341241144230 |
6 | 21554415303241 |
7 | 2125610115223 |
oct | 342753405311 |
9 | 86557648017 |
10 | 30462053065 |
11 | 11a12042374 |
12 | 5aa181ab21 |
13 | 2b46021c92 |
14 | 168d963413 |
15 | bd449877a |
hex | 717ae0ac9 |
30462053065 has 4 divisors (see below), whose sum is σ = 36554463684. Its totient is φ = 24369642448.
The previous prime is 30462053057. The next prime is 30462053081. The reversal of 30462053065 is 56035026403.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 56035026403 = 241 ⋅232510483.
It can be written as a sum of positive squares in 2 ways, for example, as 18024673536 + 12437379529 = 134256^2 + 111523^2 .
It is a cyclic number.
It is not a de Polignac number, because 30462053065 - 23 = 30462053057 is a prime.
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 30462053065.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3046205302 + ... + 3046205311.
It is an arithmetic number, because the mean of its divisors is an integer number (9138615921).
Almost surely, 230462053065 is an apocalyptic number.
It is an amenable number.
30462053065 is a deficient number, since it is larger than the sum of its proper divisors (6092410619).
30462053065 is an equidigital number, since it uses as much as digits as its factorization.
30462053065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6092410618.
The product of its (nonzero) digits is 64800, while the sum is 34.
Adding to 30462053065 its reverse (56035026403), we get a palindrome (86497079468).
The spelling of 30462053065 in words is "thirty billion, four hundred sixty-two million, fifty-three thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •