Base | Representation |
---|---|
bin | 1011010010100001… |
… | …0001000100010111 |
3 | 21211012100001010110 |
4 | 2310220101010113 |
5 | 22201244021201 |
6 | 1220413054103 |
7 | 135045303315 |
oct | 26450210427 |
9 | 7735301113 |
10 | 3030454551 |
11 | 13156813a3 |
12 | 706a87333 |
13 | 393ab8397 |
14 | 20a6930b5 |
15 | 12b0ac6d6 |
hex | b4a11117 |
3030454551 has 8 divisors (see below), whose sum is σ = 4040906224. Its totient is φ = 2020152960.
The previous prime is 3030454523. The next prime is 3030454577. The reversal of 3030454551 is 1554540303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3030454551 - 26 = 3030454487 is a prime.
It is a super-2 number, since 2×30304545512 = 18367309571353223202, 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 (3030454501) 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 7 ways as a sum of consecutive naturals, for example, 24015 + ... + 81471.
It is an arithmetic number, because the mean of its divisors is an integer number (505113278).
Almost surely, 23030454551 is an apocalyptic number.
3030454551 is a deficient number, since it is larger than the sum of its proper divisors (1010451673).
3030454551 is a wasteful number, since it uses less digits than its factorization.
3030454551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75041.
The product of its (nonzero) digits is 18000, while the sum is 30.
The square root of 3030454551 is about 55049.5644941901. The cubic root of 3030454551 is about 1447.1134888756.
Adding to 3030454551 its reverse (1554540303), we get a palindrome (4584994854).
The spelling of 3030454551 in words is "three billion, thirty million, four hundred fifty-four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •