Base | Representation |
---|---|
bin | 111010101010… |
… | …1111000000101 |
3 | 2010212210102001 |
4 | 1311111320011 |
5 | 30333313303 |
6 | 3015145301 |
7 | 522313423 |
oct | 165257005 |
9 | 63783361 |
10 | 30760453 |
11 | 163aa869 |
12 | a375231 |
13 | 64b0169 |
14 | 412a113 |
15 | 2a7931d |
hex | 1d55e05 |
30760453 has 4 divisors (see below), whose sum is σ = 32097888. Its totient is φ = 29423020.
The previous prime is 30760451. The next prime is 30760493. The reversal of 30760453 is 35406703.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 35406703 = 53 ⋅668051.
It is a cyclic number.
It is not a de Polignac number, because 30760453 - 21 = 30760451 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30760451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 668683 + ... + 668728.
It is an arithmetic number, because the mean of its divisors is an integer number (8024472).
Almost surely, 230760453 is an apocalyptic number.
It is an amenable number.
30760453 is a deficient number, since it is larger than the sum of its proper divisors (1337435).
30760453 is a wasteful number, since it uses less digits than its factorization.
30760453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1337434.
The product of its (nonzero) digits is 7560, while the sum is 28.
The square root of 30760453 is about 5546.2106883890. The cubic root of 30760453 is about 313.3268233394.
It can be divided in two parts, 30760 and 453, that added together give a palindrome (31213).
The spelling of 30760453 in words is "thirty million, seven hundred sixty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •