Base | Representation |
---|---|
bin | 1011010111001100… |
… | …1101011000010000 |
3 | 21212120022010221120 |
4 | 2311303031120100 |
5 | 22221311201430 |
6 | 1222354122240 |
7 | 135404265345 |
oct | 26563153020 |
9 | 7776263846 |
10 | 3050100240 |
11 | 132577a500 |
12 | 711580380 |
13 | 397ba6455 |
14 | 20d1287cc |
15 | 12cb8d610 |
hex | b5ccd610 |
3050100240 has 120 divisors (see below), whose sum is σ = 10393126464. Its totient is φ = 739411200.
The previous prime is 3050100197. The next prime is 3050100241. The reversal of 3050100240 is 420010503.
It is a tau number, because it is divible by the number of its divisors (120).
It is a super-2 number, since 2×30501002402 = 18606222948096115200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (3050100241) 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, 23476 + ... + 81555.
Almost surely, 23050100240 is an apocalyptic number.
3050100240 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3050100240 is an abundant number, since it is smaller than the sum of its proper divisors (7343026224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3050100240 is a wasteful number, since it uses less digits than its factorization.
3050100240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105069 (or 105052 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 15.
The square root of 3050100240 is about 55227.7126087981. The cubic root of 3050100240 is about 1450.2338489268.
Adding to 3050100240 its reverse (420010503), we get a palindrome (3470110743).
The spelling of 3050100240 in words is "three billion, fifty million, one hundred thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •