Base | Representation |
---|---|
bin | 1001010011100101101… |
… | …01111100001000111101 |
3 | 1010120100020011120210221 |
4 | 10221302311330020331 |
5 | 20214324101304433 |
6 | 402520524501341 |
7 | 32046544616314 |
oct | 4516265741075 |
9 | 1116306146727 |
10 | 319754322493 |
11 | 113674a85161 |
12 | 51b790aa851 |
13 | 241ca648428 |
14 | 1169495527b |
15 | 84b6a9b72d |
hex | 4a72d7c23d |
319754322493 has 2 divisors, whose sum is σ = 319754322494. Its totient is φ = 319754322492.
The previous prime is 319754322491. The next prime is 319754322523. The reversal of 319754322493 is 394223457913.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 257680094884 + 62074227609 = 507622^2 + 249147^2 .
It is an emirp because it is prime and its reverse (394223457913) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 319754322493 - 21 = 319754322491 is a prime.
Together with 319754322491, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 319754322493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (319754322491) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 159877161246 + 159877161247.
It is an arithmetic number, because the mean of its divisors is an integer number (159877161247).
Almost surely, 2319754322493 is an apocalyptic number.
It is an amenable number.
319754322493 is a deficient number, since it is larger than the sum of its proper divisors (1).
319754322493 is an equidigital number, since it uses as much as digits as its factorization.
319754322493 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4898880, while the sum is 52.
The spelling of 319754322493 in words is "three hundred nineteen billion, seven hundred fifty-four million, three hundred twenty-two thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •