Base | Representation |
---|---|
bin | 1111100010001111… |
… | …11011010101011101 |
3 | 210112020211220100201 |
4 | 13301013323111131 |
5 | 114040112320042 |
6 | 3455334423501 |
7 | 413452562014 |
oct | 76107732535 |
9 | 23466756321 |
10 | 8340354397 |
11 | 359aa04781 |
12 | 1749201b91 |
13 | a2bbccb5b |
14 | 591983a7b |
15 | 33c32b1b7 |
hex | 1f11fb55d |
8340354397 has 2 divisors, whose sum is σ = 8340354398. Its totient is φ = 8340354396.
The previous prime is 8340354353. The next prime is 8340354413. The reversal of 8340354397 is 7934530438.
8340354397 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6757826436 + 1582527961 = 82206^2 + 39781^2 .
It is a cyclic number.
It is not a de Polignac number, because 8340354397 - 227 = 8206136669 is a prime.
It is a super-2 number, since 2×83403543972 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8340354307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4170177198 + 4170177199.
It is an arithmetic number, because the mean of its divisors is an integer number (4170177199).
Almost surely, 28340354397 is an apocalyptic number.
It is an amenable number.
8340354397 is a deficient number, since it is larger than the sum of its proper divisors (1).
8340354397 is an equidigital number, since it uses as much as digits as its factorization.
8340354397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1088640, while the sum is 46.
The square root of 8340354397 is about 91325.5407703672. The cubic root of 8340354397 is about 2027.9698857256.
The spelling of 8340354397 in words is "eight billion, three hundred forty million, three hundred fifty-four thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •