Base | Representation |
---|---|
bin | 111001011111… |
… | …0110101001001 |
3 | 2002201100201211 |
4 | 1302332311021 |
5 | 30204014034 |
6 | 2554013121 |
7 | 514125610 |
oct | 162766511 |
9 | 62640654 |
10 | 30141769 |
11 | 16017a59 |
12 | a1171a1 |
13 | 6324688 |
14 | 4008877 |
15 | 29a5d64 |
hex | 1cbed49 |
30141769 has 4 divisors (see below), whose sum is σ = 34447744. Its totient is φ = 25835796.
The previous prime is 30141767. The next prime is 30141779. The reversal of 30141769 is 96714103.
It is a happy number.
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: 96714103 = 23 ⋅4204961.
It is not a de Polignac number, because 30141769 - 21 = 30141767 is a prime.
It is a super-2 number, since 2×301417692 = 1817052476898722, which contains 22 as substring.
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 30141769.
It is not an unprimeable number, because it can be changed into a prime (30141767) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2152977 + ... + 2152990.
It is an arithmetic number, because the mean of its divisors is an integer number (8611936).
Almost surely, 230141769 is an apocalyptic number.
It is an amenable number.
30141769 is a deficient number, since it is larger than the sum of its proper divisors (4305975).
30141769 is an equidigital number, since it uses as much as digits as its factorization.
30141769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4305974.
The product of its (nonzero) digits is 4536, while the sum is 31.
The square root of 30141769 is about 5490.1520015388. The cubic root of 30141769 is about 311.2119363355.
The spelling of 30141769 in words is "thirty million, one hundred forty-one thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •