Base | Representation |
---|---|
bin | 100011100101101100001100… |
… | …1011111110010100000011001 |
3 | 1112001101122202202201220100222 |
4 | 1013023120121133302200121 |
5 | 312012400403002144433 |
6 | 3025442054211405425 |
7 | 122636432425143533 |
oct | 10713303137624031 |
9 | 1461348682656328 |
10 | 313043414099993 |
11 | 90821a6a2640a5 |
12 | 2b139ab1bb3875 |
13 | 10589b375643a5 |
14 | 574354c626853 |
15 | 262ce9e5bcb98 |
hex | 11cb6197f2819 |
313043414099993 has 2 divisors, whose sum is σ = 313043414099994. Its totient is φ = 313043414099992.
The previous prime is 313043414099971. The next prime is 313043414100101. The reversal of 313043414099993 is 399990414340313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 306569178119689 + 6474235980304 = 17509117^2 + 2544452^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-313043414099993 is a prime.
It is a super-3 number, since 3×3130434140999933 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (313043414099953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156521707049996 + 156521707049997.
It is an arithmetic number, because the mean of its divisors is an integer number (156521707049997).
Almost surely, 2313043414099993 is an apocalyptic number.
It is an amenable number.
313043414099993 is a deficient number, since it is larger than the sum of its proper divisors (1).
313043414099993 is an equidigital number, since it uses as much as digits as its factorization.
313043414099993 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34012224, while the sum is 62.
The spelling of 313043414099993 in words is "three hundred thirteen trillion, forty-three billion, four hundred fourteen million, ninety-nine thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •