Base | Representation |
---|---|
bin | 111010000111100… |
… | …0101010010111000 |
3 | 12000220110220020210 |
4 | 1310033011102320 |
5 | 12443212022104 |
6 | 521301351120 |
7 | 66216445350 |
oct | 16417052270 |
9 | 5026426223 |
10 | 1950110904 |
11 | 910872205 |
12 | 4651084a0 |
13 | 25102a5a1 |
14 | 146dcdb60 |
15 | b630a989 |
hex | 743c54b8 |
1950110904 has 128 divisors (see below), whose sum is σ = 5946048000. Its totient is φ = 520556544.
The previous prime is 1950110879. The next prime is 1950110909. The reversal of 1950110904 is 4090110591.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1950110909) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 228832 + ... + 237200.
It is an arithmetic number, because the mean of its divisors is an integer number (46453500).
Almost surely, 21950110904 is an apocalyptic number.
1950110904 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1950110904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2973024000).
1950110904 is an abundant number, since it is smaller than the sum of its proper divisors (3995937096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1950110904 is a wasteful number, since it uses less digits than its factorization.
1950110904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8477 (or 8473 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 30.
The square root of 1950110904 is about 44160.0600543070. The cubic root of 1950110904 is about 1249.3566618029.
The spelling of 1950110904 in words is "one billion, nine hundred fifty million, one hundred ten thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •