Base | Representation |
---|---|
bin | 100011100101100010101100… |
… | …1100000001010000101111101 |
3 | 1112001022201002222122211012211 |
4 | 1013023011121200022011331 |
5 | 312012032112323230244 |
6 | 3025424441555300421 |
7 | 122635111033420243 |
oct | 10713053140120575 |
9 | 1461281088584184 |
10 | 313023013101949 |
11 | 90814350448337 |
12 | 2b135b598aa711 |
13 | 10587c35a88b07 |
14 | 5742574d9a793 |
15 | 262c6a8542934 |
hex | 11cb15980a17d |
313023013101949 has 2 divisors, whose sum is σ = 313023013101950. Its totient is φ = 313023013101948.
The previous prime is 313023013101913. The next prime is 313023013101989. The reversal of 313023013101949 is 949101310320313.
It is an a-pointer prime, because the next prime (313023013101989) can be obtained adding 313023013101949 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 257868774073849 + 55154239028100 = 16058293^2 + 7426590^2 .
It is a cyclic number.
It is not a de Polignac number, because 313023013101949 - 233 = 313014423167357 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313023013101989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156511506550974 + 156511506550975.
It is an arithmetic number, because the mean of its divisors is an integer number (156511506550975).
Almost surely, 2313023013101949 is an apocalyptic number.
It is an amenable number.
313023013101949 is a deficient number, since it is larger than the sum of its proper divisors (1).
313023013101949 is an equidigital number, since it uses as much as digits as its factorization.
313023013101949 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 52488, while the sum is 40.
The spelling of 313023013101949 in words is "three hundred thirteen trillion, twenty-three billion, thirteen million, one hundred one thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •