Base | Representation |
---|---|
bin | 111100110010101… |
… | …011001000101001 |
3 | 2122002011010212211 |
4 | 330302223020221 |
5 | 4042044314331 |
6 | 245112205121 |
7 | 34163102326 |
oct | 7462531051 |
9 | 2562133784 |
10 | 1019916841 |
11 | 483797689 |
12 | 2456997a1 |
13 | 1333c17b8 |
14 | 99653b4d |
15 | 5e8178b1 |
hex | 3ccab229 |
1019916841 has 2 divisors, whose sum is σ = 1019916842. Its totient is φ = 1019916840.
The previous prime is 1019916791. The next prime is 1019916857. The reversal of 1019916841 is 1486199101.
1019916841 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 696960000 + 322956841 = 26400^2 + 17971^2 .
It is an emirp because it is prime and its reverse (1486199101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1019916841 - 29 = 1019916329 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1019916794 and 1019916803.
It is not a weakly prime, because it can be changed into another prime (1019913841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 509958420 + 509958421.
It is an arithmetic number, because the mean of its divisors is an integer number (509958421).
Almost surely, 21019916841 is an apocalyptic number.
It is an amenable number.
1019916841 is a deficient number, since it is larger than the sum of its proper divisors (1).
1019916841 is an equidigital number, since it uses as much as digits as its factorization.
1019916841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 40.
The square root of 1019916841 is about 31936.1369141604. The cubic root of 1019916841 is about 1006.5953526931.
The spelling of 1019916841 in words is "one billion, nineteen million, nine hundred sixteen thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •