Base | Representation |
---|---|
bin | 100011101000110100111011… |
… | …0000110011110010011001001 |
3 | 1112002220212101102001201102111 |
4 | 1013101221312012132103021 |
5 | 312041431200401134223 |
6 | 3030412103025102321 |
7 | 123012532312651312 |
oct | 10721516606362311 |
9 | 1462825342051374 |
10 | 313474464474313 |
11 | 90978856a2a27a |
12 | 2b1a954ba879a1 |
13 | 105bb690a6158c |
14 | 575a360535609 |
15 | 26392cbe2230d |
hex | 11d1a7619e4c9 |
313474464474313 has 2 divisors, whose sum is σ = 313474464474314. Its totient is φ = 313474464474312.
The previous prime is 313474464474251. The next prime is 313474464474343.
313474464474313 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 255020075545104 + 58454388929209 = 15969348^2 + 7645547^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 313474464474313 - 29 = 313474464473801 is a prime.
It is a super-2 number, since 2×3134744644743132 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (313474464474343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156737232237156 + 156737232237157.
It is an arithmetic number, because the mean of its divisors is an integer number (156737232237157).
Almost surely, 2313474464474313 is an apocalyptic number.
It is an amenable number.
313474464474313 is a deficient number, since it is larger than the sum of its proper divisors (1).
313474464474313 is an equidigital number, since it uses as much as digits as its factorization.
313474464474313 is an evil number, because the sum of its binary digits is even.
The product of its digits is 97542144, while the sum is 58.
The spelling of 313474464474313 in words is "three hundred thirteen trillion, four hundred seventy-four billion, four hundred sixty-four million, four hundred seventy-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •