Base | Representation |
---|---|
bin | 111001011100… |
… | …0010011001110 |
3 | 2002200000001012 |
4 | 1302320103032 |
5 | 30202140042 |
6 | 2553245222 |
7 | 513654620 |
oct | 162702316 |
9 | 62600035 |
10 | 30115022 |
11 | 15aa9953 |
12 | a103812 |
13 | 6315452 |
14 | 3ddcc10 |
15 | 299ce82 |
hex | 1cb84ce |
30115022 has 8 divisors (see below), whose sum is σ = 51625776. Its totient is φ = 12906432.
The previous prime is 30115013. The next prime is 30115031. The reversal of 30115022 is 22051103.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (30115013) and next prime (30115031).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 2151073 = 30115022 / (3 + 0 + 1 + 1 + 5 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 30114988 and 30115006.
It is a congruent number.
It is an unprimeable number.
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, 1075523 + ... + 1075550.
It is an arithmetic number, because the mean of its divisors is an integer number (6453222).
Almost surely, 230115022 is an apocalyptic number.
30115022 is a deficient number, since it is larger than the sum of its proper divisors (21510754).
30115022 is a wasteful number, since it uses less digits than its factorization.
30115022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2151082.
The product of its (nonzero) digits is 60, while the sum is 14.
The square root of 30115022 is about 5487.7155538530. The cubic root of 30115022 is about 311.1198553759.
Adding to 30115022 its reverse (22051103), we get a palindrome (52166125).
The spelling of 30115022 in words is "thirty million, one hundred fifteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •