Base | Representation |
---|---|
bin | 1011010100110011… |
… | …1000011100010011 |
3 | 21211212101200201222 |
4 | 2311030320130103 |
5 | 22211223144021 |
6 | 1221354515255 |
7 | 135223011212 |
oct | 26514703423 |
9 | 7755350658 |
10 | 3040053011 |
11 | 1320037906 |
12 | 70a135b2b |
13 | 395a99248 |
14 | 20ba71079 |
15 | 12bd566ab |
hex | b5338713 |
3040053011 has 8 divisors (see below), whose sum is σ = 3077319600. Its totient is φ = 3002855680.
The previous prime is 3040052989. The next prime is 3040053019. The reversal of 3040053011 is 1103500403.
3040053011 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 3040053011 - 230 = 1966311187 is a prime.
It is a super-2 number, since 2×30400530112 = 18483844619380332242, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3040053019) 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, 73931 + ... + 107451.
It is an arithmetic number, because the mean of its divisors is an integer number (384664950).
Almost surely, 23040053011 is an apocalyptic number.
3040053011 is a deficient number, since it is larger than the sum of its proper divisors (37266589).
3040053011 is a wasteful number, since it uses less digits than its factorization.
3040053011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34629.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 3040053011 is about 55136.6757340339. The cubic root of 3040053011 is about 1448.6397089676.
Adding to 3040053011 its reverse (1103500403), we get a palindrome (4143553414).
The spelling of 3040053011 in words is "three billion, forty million, fifty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •