Base | Representation |
---|---|
bin | 11101011110111001011… |
… | …00010101010101100101 |
3 | 10120211210002201002021112 |
4 | 32233130230111111211 |
5 | 113044131100030223 |
6 | 2053212552354405 |
7 | 133121402164412 |
oct | 16573454252545 |
9 | 3524702632245 |
10 | 1013019923813 |
11 | 36068a379407 |
12 | 1443b63a5a05 |
13 | 746b1825081 |
14 | 3705d6bb109 |
15 | 1b53e801778 |
hex | ebdcb15565 |
1013019923813 has 2 divisors, whose sum is σ = 1013019923814. Its totient is φ = 1013019923812.
The previous prime is 1013019923749. The next prime is 1013019923827. The reversal of 1013019923813 is 3183299103101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 894496025284 + 118523898529 = 945778^2 + 344273^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013019923813 - 26 = 1013019923749 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013019929813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506509961906 + 506509961907.
It is an arithmetic number, because the mean of its divisors is an integer number (506509961907).
Almost surely, 21013019923813 is an apocalyptic number.
It is an amenable number.
1013019923813 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013019923813 is an equidigital number, since it uses as much as digits as its factorization.
1013019923813 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 41.
The spelling of 1013019923813 in words is "one trillion, thirteen billion, nineteen million, nine hundred twenty-three thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •