Base | Representation |
---|---|
bin | 1001101110010000… |
… | …11110000010111101 |
3 | 111110210020010211121 |
4 | 10313020132002331 |
5 | 41142300400042 |
6 | 2221545150541 |
7 | 243232465426 |
oct | 46710360275 |
9 | 14423203747 |
10 | 5219934397 |
11 | 2239575a77 |
12 | 101818b451 |
13 | 6525a54a2 |
14 | 37739264d |
15 | 2083ec367 |
hex | 13721e0bd |
5219934397 has 2 divisors, whose sum is σ = 5219934398. Its totient is φ = 5219934396.
The previous prime is 5219934347. The next prime is 5219934403. The reversal of 5219934397 is 7934399125.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5094247876 + 125686521 = 71374^2 + 11211^2 .
It is a cyclic number.
It is not a de Polignac number, because 5219934397 - 219 = 5219410109 is a prime.
It is a super-3 number, since 3×52199343973 (a number of 30 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5219934347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2609967198 + 2609967199.
It is an arithmetic number, because the mean of its divisors is an integer number (2609967199).
Almost surely, 25219934397 is an apocalyptic number.
It is an amenable number.
5219934397 is a deficient number, since it is larger than the sum of its proper divisors (1).
5219934397 is an equidigital number, since it uses as much as digits as its factorization.
5219934397 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1837080, while the sum is 52.
The square root of 5219934397 is about 72249.1134686094. The cubic root of 5219934397 is about 1734.6892280295.
The spelling of 5219934397 in words is "five billion, two hundred nineteen million, nine hundred thirty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •