Base | Representation |
---|---|
bin | 1011010010111000… |
… | …1011011011010111 |
3 | 21211022020202222222 |
4 | 2310232023123113 |
5 | 22202143114221 |
6 | 1220510212555 |
7 | 135064416500 |
oct | 26456133327 |
9 | 7738222888 |
10 | 3032004311 |
11 | 131653a796 |
12 | 7074b415b |
13 | 39420b8bb |
14 | 20a977ba7 |
15 | 12b2b69ab |
hex | b4b8b6d7 |
3032004311 has 12 divisors (see below), whose sum is σ = 3532304592. Its totient is φ = 2594971008.
The previous prime is 3032004289. The next prime is 3032004319. The reversal of 3032004311 is 1134002303.
It is a happy number.
It is not a de Polignac number, because 3032004311 - 210 = 3032003287 is a prime.
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 3032004311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3032004319) 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 11 ways as a sum of consecutive naturals, for example, 12995 + ... + 78948.
It is an arithmetic number, because the mean of its divisors is an integer number (294358716).
Almost surely, 23032004311 is an apocalyptic number.
3032004311 is a deficient number, since it is larger than the sum of its proper divisors (500300281).
3032004311 is an equidigital number, since it uses as much as digits as its factorization.
3032004311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92630 (or 92623 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 3032004311 is about 55063.6387373737. The cubic root of 3032004311 is about 1447.3601291484.
Adding to 3032004311 its reverse (1134002303), we get a palindrome (4166006614).
The spelling of 3032004311 in words is "three billion, thirty-two million, four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •