Base | Representation |
---|---|
bin | 1011010101000100… |
… | …0100010011111000 |
3 | 21211221110102210121 |
4 | 2311101010103320 |
5 | 22212013301300 |
6 | 1221434223024 |
7 | 135235231054 |
oct | 26521042370 |
9 | 7757412717 |
10 | 3041150200 |
11 | 1320717180 |
12 | 70a584a74 |
13 | 39609177a |
14 | 20bc78c64 |
15 | 12bec181a |
hex | b54444f8 |
3041150200 has 96 divisors (see below), whose sum is σ = 7727250960. Its totient is φ = 1103897600.
The previous prime is 3041150191. The next prime is 3041150209. The reversal of 3041150200 is 20511403.
It is an interprime number because it is at equal distance from previous prime (3041150191) and next prime (3041150209).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3041150209) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1884594 + ... + 1886206.
Almost surely, 23041150200 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3041150200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3863625480).
3041150200 is an abundant number, since it is smaller than the sum of its proper divisors (4686100760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3041150200 is a wasteful number, since it uses less digits than its factorization.
3041150200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2497 (or 2488 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 3041150200 is about 55146.6245567215. The cubic root of 3041150200 is about 1448.8139647423.
Adding to 3041150200 its reverse (20511403), we get a palindrome (3061661603).
The spelling of 3041150200 in words is "three billion, forty-one million, one hundred fifty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •