Base | Representation |
---|---|
bin | 1011010000110101… |
… | …1101101100111011 |
3 | 21210201010002002001 |
4 | 2310031131230323 |
5 | 22142444202121 |
6 | 1220002321431 |
7 | 134631501043 |
oct | 26415355473 |
9 | 7721102061 |
10 | 3023428411 |
11 | 1311712573 |
12 | 704659277 |
13 | 3924c82c3 |
14 | 209784723 |
15 | 12a670991 |
hex | b435db3b |
3023428411 has 4 divisors (see below), whose sum is σ = 3023693712. Its totient is φ = 3023163112.
The previous prime is 3023428381. The next prime is 3023428423. The reversal of 3023428411 is 1148243203.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3023428411 - 27 = 3023428283 is a prime.
It is a super-2 number, since 2×30234284112 = 18282238712883969842, 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 3023428411.
It is not an unprimeable number, because it can be changed into a prime (3023428451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 114751 + ... + 138616.
It is an arithmetic number, because the mean of its divisors is an integer number (755923428).
Almost surely, 23023428411 is an apocalyptic number.
3023428411 is a deficient number, since it is larger than the sum of its proper divisors (265301).
3023428411 is a wasteful number, since it uses less digits than its factorization.
3023428411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265300.
The product of its (nonzero) digits is 4608, while the sum is 28.
The square root of 3023428411 is about 54985.7109711241. The cubic root of 3023428411 is about 1445.9942409381.
The spelling of 3023428411 in words is "three billion, twenty-three million, four hundred twenty-eight thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •