Base | Representation |
---|---|
bin | 100011101000100110110011… |
… | …0010010100101001111010101 |
3 | 1112002210222002122202102202012 |
4 | 1013101031212102211033111 |
5 | 312040432041404120231 |
6 | 3030350125243154005 |
7 | 123010406564641046 |
oct | 10721154622451725 |
9 | 1462728078672665 |
10 | 313444134441941 |
11 | 90966a0246a018 |
12 | 2b1a36a6515905 |
13 | 105b88691b4a69 |
14 | 5758ac433a8cd |
15 | 2638604355e2b |
hex | 11d13664a53d5 |
313444134441941 has 2 divisors, whose sum is σ = 313444134441942. Its totient is φ = 313444134441940.
The previous prime is 313444134441863. The next prime is 313444134442037. The reversal of 313444134441941 is 149144431444313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 234316953982225 + 79127180459716 = 15307415^2 + 8895346^2 .
It is a cyclic number.
It is not a de Polignac number, because 313444134441941 - 214 = 313444134425557 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 313444134441941.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313444134441041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156722067220970 + 156722067220971.
It is an arithmetic number, because the mean of its divisors is an integer number (156722067220971).
Almost surely, 2313444134441941 is an apocalyptic number.
It is an amenable number.
313444134441941 is a deficient number, since it is larger than the sum of its proper divisors (1).
313444134441941 is an equidigital number, since it uses as much as digits as its factorization.
313444134441941 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3981312, while the sum is 50.
The spelling of 313444134441941 in words is "three hundred thirteen trillion, four hundred forty-four billion, one hundred thirty-four million, four hundred forty-one thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •