Base | Representation |
---|---|
bin | 1010111110010011110… |
… | …01101000000001100001 |
3 | 1100001020020010020000012 |
4 | 11133021321220001201 |
5 | 22134144131400223 |
6 | 445114130534305 |
7 | 36145431465551 |
oct | 5371171500141 |
9 | 1301206106005 |
10 | 377049481313 |
11 | 1359a6669a8a |
12 | 610a9137395 |
13 | 2972b8b547b |
14 | 1436c0b5161 |
15 | 9c1bb0ec78 |
hex | 57c9e68061 |
377049481313 has 2 divisors, whose sum is σ = 377049481314. Its totient is φ = 377049481312.
The previous prime is 377049481297. The next prime is 377049481331. The reversal of 377049481313 is 313184940773.
Together with next prime (377049481331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 372646760704 + 4402720609 = 610448^2 + 66353^2 .
It is an emirp because it is prime and its reverse (313184940773) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 377049481313 - 24 = 377049481297 is a prime.
It is a super-2 number, since 2×3770494813132 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (377049487313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 188524740656 + 188524740657.
It is an arithmetic number, because the mean of its divisors is an integer number (188524740657).
Almost surely, 2377049481313 is an apocalyptic number.
It is an amenable number.
377049481313 is a deficient number, since it is larger than the sum of its proper divisors (1).
377049481313 is an equidigital number, since it uses as much as digits as its factorization.
377049481313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1524096, while the sum is 50.
The spelling of 377049481313 in words is "three hundred seventy-seven billion, forty-nine million, four hundred eighty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •