Base | Representation |
---|---|
bin | 111100110000101… |
… | …011000001100100 |
3 | 2122001011111001222 |
4 | 330300223001210 |
5 | 4041431021400 |
6 | 245053035512 |
7 | 34155455426 |
oct | 7460530144 |
9 | 2561144058 |
10 | 1019392100 |
11 | 483469411 |
12 | 245485b98 |
13 | 1332699bc |
14 | 99558816 |
15 | 5e762185 |
hex | 3cc2b064 |
1019392100 has 18 divisors (see below), whose sum is σ = 2212081074. Its totient is φ = 407756800.
The previous prime is 1019392093. The next prime is 1019392117. The reversal of 1019392100 is 12939101.
It can be written as a sum of positive squares in 3 ways, for example, as 11075584 + 1008316516 = 3328^2 + 31754^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1019392100.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5096861 + ... + 5097060.
It is an arithmetic number, because the mean of its divisors is an integer number (122893393).
Almost surely, 21019392100 is an apocalyptic number.
1019392100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1019392100 is an abundant number, since it is smaller than the sum of its proper divisors (1192688974).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1019392100 is a wasteful number, since it uses less digits than its factorization.
1019392100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10193935 (or 10193928 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 26.
The square root of 1019392100 is about 31927.9203832633. The cubic root of 1019392100 is about 1006.4226940207.
The spelling of 1019392100 in words is "one billion, nineteen million, three hundred ninety-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •