Base | Representation |
---|---|
bin | 111011000100… |
… | …0100111010101 |
3 | 2011021100111020 |
4 | 1312020213111 |
5 | 30411441102 |
6 | 3023431353 |
7 | 524140344 |
oct | 166104725 |
9 | 64240436 |
10 | 30968277 |
11 | 16531a1a |
12 | a455559 |
13 | 6553932 |
14 | 4181b5b |
15 | 2ababbc |
hex | 1d889d5 |
30968277 has 4 divisors (see below), whose sum is σ = 41291040. Its totient is φ = 20645516.
The previous prime is 30968257. The next prime is 30968291. The reversal of 30968277 is 77286903.
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: 77286903 = 3 ⋅25762301.
It is a cyclic number.
It is not a de Polignac number, because 30968277 - 212 = 30964181 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30968257) 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, 5161377 + ... + 5161382.
It is an arithmetic number, because the mean of its divisors is an integer number (10322760).
Almost surely, 230968277 is an apocalyptic number.
It is an amenable number.
30968277 is a deficient number, since it is larger than the sum of its proper divisors (10322763).
30968277 is a wasteful number, since it uses less digits than its factorization.
30968277 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10322762.
The product of its (nonzero) digits is 127008, while the sum is 42.
The square root of 30968277 is about 5564.9148241460. The cubic root of 30968277 is about 314.0308738085.
It can be divided in two parts, 309 and 68277, that added together give a palindrome (68586).
The spelling of 30968277 in words is "thirty million, nine hundred sixty-eight thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •