Base | Representation |
---|---|
bin | 1111011001101101… |
… | …0100011100111101 |
3 | 101200010112002022211 |
4 | 3312123110130331 |
5 | 31431343404142 |
6 | 1522125340421 |
7 | 204311311234 |
oct | 36633243475 |
9 | 11603462284 |
10 | 4134356797 |
11 | 18318114aa |
12 | 974707711 |
13 | 50b70428c |
14 | 2b3129b1b |
15 | 192e64917 |
hex | f66d473d |
4134356797 has 2 divisors, whose sum is σ = 4134356798. Its totient is φ = 4134356796.
The previous prime is 4134356761. The next prime is 4134356839. The reversal of 4134356797 is 7976534314.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2780558361 + 1353798436 = 52731^2 + 36794^2 .
It is a cyclic number.
It is not a de Polignac number, because 4134356797 - 227 = 4000139069 is a prime.
It is a super-2 number, since 2×41343567972 = 34185812249800198418, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4134356797.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4134356197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2067178398 + 2067178399.
It is an arithmetic number, because the mean of its divisors is an integer number (2067178399).
Almost surely, 24134356797 is an apocalyptic number.
It is an amenable number.
4134356797 is a deficient number, since it is larger than the sum of its proper divisors (1).
4134356797 is an equidigital number, since it uses as much as digits as its factorization.
4134356797 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1905120, while the sum is 49.
The square root of 4134356797 is about 64298.9641985001. The cubic root of 4134356797 is about 1604.9788653512.
The spelling of 4134356797 in words is "four billion, one hundred thirty-four million, three hundred fifty-six thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •