Base | Representation |
---|---|
bin | 101100000001110001110111… |
… | …0001101100100001001110101 |
3 | 1212210012220021220012112110111 |
4 | 1120003203232031210021311 |
5 | 401230033300031212333 |
6 | 3451354325131023021 |
7 | 144400344146120353 |
oct | 13003435615441165 |
9 | 1783186256175414 |
10 | 387272607679093 |
11 | 10244043294a064 |
12 | 3752803889aa71 |
13 | 1381285b65a436 |
14 | 6b8c14679a7d3 |
15 | 2eb8cb14274cd |
hex | 16038ee364275 |
387272607679093 has 2 divisors, whose sum is σ = 387272607679094. Its totient is φ = 387272607679092.
The previous prime is 387272607679033. The next prime is 387272607679151. The reversal of 387272607679093 is 390976706272783.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 282229315301124 + 105043292377969 = 16799682^2 + 10249063^2 .
It is a cyclic number.
It is not a de Polignac number, because 387272607679093 - 225 = 387272574124661 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (387272607679033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 193636303839546 + 193636303839547.
It is an arithmetic number, because the mean of its divisors is an integer number (193636303839547).
Almost surely, 2387272607679093 is an apocalyptic number.
It is an amenable number.
387272607679093 is a deficient number, since it is larger than the sum of its proper divisors (1).
387272607679093 is an equidigital number, since it uses as much as digits as its factorization.
387272607679093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016379008, while the sum is 76.
The spelling of 387272607679093 in words is "three hundred eighty-seven trillion, two hundred seventy-two billion, six hundred seven million, six hundred seventy-nine thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •