Base | Representation |
---|---|
bin | 1011010001101100… |
… | …1010111010011101 |
3 | 21210221212121211021 |
4 | 2310123022322131 |
5 | 22144404141334 |
6 | 1220211324141 |
7 | 135004154323 |
oct | 26433127235 |
9 | 7727777737 |
10 | 3027021469 |
11 | 131374703a |
12 | 7058b0651 |
13 | 393185884 |
14 | 20a03bd13 |
15 | 12ab303b4 |
hex | b46cae9d |
3027021469 has 4 divisors (see below), whose sum is σ = 3027189760. Its totient is φ = 3026853180.
The previous prime is 3027021449. The next prime is 3027021493. The reversal of 3027021469 is 9641207203.
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: 9641207203 = 43 ⋅224214121.
It is a cyclic number.
It is not a de Polignac number, because 3027021469 - 211 = 3027019421 is a prime.
It is a super-2 number, since 2×30270214692 = 18325717947573835922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3027021449) 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, 53427 + ... + 94384.
It is an arithmetic number, because the mean of its divisors is an integer number (756797440).
Almost surely, 23027021469 is an apocalyptic number.
It is an amenable number.
3027021469 is a deficient number, since it is larger than the sum of its proper divisors (168291).
3027021469 is a wasteful number, since it uses less digits than its factorization.
3027021469 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168290.
The product of its (nonzero) digits is 18144, while the sum is 34.
The square root of 3027021469 is about 55018.3739218091. The cubic root of 3027021469 is about 1446.5668231959.
The spelling of 3027021469 in words is "three billion, twenty-seven million, twenty-one thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •