Base | Representation |
---|---|
bin | 111010000101… |
… | …0010110011101 |
3 | 2010022002001120 |
4 | 1310022112131 |
5 | 30243413401 |
6 | 3004401153 |
7 | 516554502 |
oct | 164122635 |
9 | 63262046 |
10 | 30451101 |
11 | 162093aa |
12 | a2461b9 |
13 | 6402405 |
14 | 40894a9 |
15 | 2a17836 |
hex | 1d0a59d |
30451101 has 4 divisors (see below), whose sum is σ = 40601472. Its totient is φ = 20300732.
The previous prime is 30451093. The next prime is 30451121. The reversal of 30451101 is 10115403.
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.
It is a cyclic number.
It is not a de Polignac number, because 30451101 - 23 = 30451093 is a prime.
It is a super-2 number, since 2×304511012 = 1854539104224402, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30451121) 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, 5075181 + ... + 5075186.
It is an arithmetic number, because the mean of its divisors is an integer number (10150368).
Almost surely, 230451101 is an apocalyptic number.
It is an amenable number.
30451101 is a deficient number, since it is larger than the sum of its proper divisors (10150371).
30451101 is a wasteful number, since it uses less digits than its factorization.
30451101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10150370.
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 30451101 is about 5518.2516252886. The cubic root of 30451101 is about 312.2729264536.
Adding to 30451101 its reverse (10115403), we get a palindrome (40566504).
The spelling of 30451101 in words is "thirty million, four hundred fifty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •