Base | Representation |
---|---|
bin | 1011010001100100… |
… | …1101001010110101 |
3 | 21210220220110022102 |
4 | 2310121031022311 |
5 | 22144241201141 |
6 | 1220152311445 |
7 | 134666610611 |
oct | 26431151265 |
9 | 7726813272 |
10 | 3026506421 |
11 | 1313425084 |
12 | 7056a2585 |
13 | 393035303 |
14 | 209d46341 |
15 | 12aa7c99b |
hex | b464d2b5 |
3026506421 has 8 divisors (see below), whose sum is σ = 3121156800. Its totient is φ = 2933301280.
The previous prime is 3026506369. The next prime is 3026506433. The reversal of 3026506421 is 1246056203.
3026506421 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3026506421 - 210 = 3026505397 is a prime.
It is a super-2 number, since 2×30265064212 = 18319482232708458482, 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 (3026506121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 357056 + ... + 365433.
It is an arithmetic number, because the mean of its divisors is an integer number (390144600).
Almost surely, 23026506421 is an apocalyptic number.
It is an amenable number.
3026506421 is a deficient number, since it is larger than the sum of its proper divisors (94650379).
3026506421 is an equidigital number, since it uses as much as digits as its factorization.
3026506421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 722619.
The product of its (nonzero) digits is 8640, while the sum is 29.
The square root of 3026506421 is about 55013.6930318262. The cubic root of 3026506421 is about 1446.4847740465.
The spelling of 3026506421 in words is "three billion, twenty-six million, five hundred six thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •