Base | Representation |
---|---|
bin | 111001000000001… |
… | …0101011001001000 |
3 | 11221022001201202120 |
4 | 1302000111121020 |
5 | 12404122041443 |
6 | 513443331240 |
7 | 65253412260 |
oct | 16200253110 |
9 | 4838051676 |
10 | 1912690248 |
11 | 8a1733547 |
12 | 454680b20 |
13 | 246357aa1 |
14 | 14204c7a0 |
15 | b2db8083 |
hex | 72015648 |
1912690248 has 64 divisors (see below), whose sum is σ = 5498434560. Its totient is φ = 543122496.
The previous prime is 1912690237. The next prime is 1912690277. The reversal of 1912690248 is 8420962191.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7540 + ... + 62307.
It is an arithmetic number, because the mean of its divisors is an integer number (85913040).
Almost surely, 21912690248 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 1912690248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2749217280).
1912690248 is an abundant number, since it is smaller than the sum of its proper divisors (3585744312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1912690248 is a wasteful number, since it uses less digits than its factorization.
1912690248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70026 (or 70022 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 42.
The square root of 1912690248 is about 43734.3143081037. The cubic root of 1912690248 is about 1241.3136979164.
The spelling of 1912690248 in words is "one billion, nine hundred twelve million, six hundred ninety thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •