Base | Representation |
---|---|
bin | 11101011110111001011… |
… | …00010101011000001001 |
3 | 10120211210002201002111121 |
4 | 32233130230111120021 |
5 | 113044131100031402 |
6 | 2053212552355241 |
7 | 133121402165035 |
oct | 16573454253011 |
9 | 3524702632447 |
10 | 1013019923977 |
11 | 36068a379546 |
12 | 1443b63a5b21 |
13 | 746b1825179 |
14 | 3705d6bb1c5 |
15 | 1b53e801837 |
hex | ebdcb15609 |
1013019923977 has 2 divisors, whose sum is σ = 1013019923978. Its totient is φ = 1013019923976.
The previous prime is 1013019923849. The next prime is 1013019924011. The reversal of 1013019923977 is 7793299103101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 798742588176 + 214277335801 = 893724^2 + 462901^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013019923977 - 27 = 1013019923849 is a prime.
It is not a weakly prime, because it can be changed into another prime (1013019993977) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506509961988 + 506509961989.
It is an arithmetic number, because the mean of its divisors is an integer number (506509961989).
Almost surely, 21013019923977 is an apocalyptic number.
It is an amenable number.
1013019923977 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013019923977 is an equidigital number, since it uses as much as digits as its factorization.
1013019923977 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 642978, while the sum is 52.
The spelling of 1013019923977 in words is "one trillion, thirteen billion, nineteen million, nine hundred twenty-three thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •