Base | Representation |
---|---|
bin | 111110001000001111110… |
… | …111011010001000010001 |
3 | 120010011020021010201021102 |
4 | 332020033313122020101 |
5 | 1024422330200103114 |
6 | 13025210423434145 |
7 | 620313201313202 |
oct | 76101767321021 |
9 | 16104207121242 |
10 | 4269463675409 |
11 | 13a673aa38279 |
12 | 58b54a8b5955 |
13 | 24c7bb3cc50a |
14 | 10a900b075a9 |
15 | 760d28ee2de |
hex | 3e20fdda211 |
4269463675409 has 2 divisors, whose sum is σ = 4269463675410. Its totient is φ = 4269463675408.
The previous prime is 4269463675387. The next prime is 4269463675441. The reversal of 4269463675409 is 9045763649624.
4269463675409 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2333247085009 + 1936216590400 = 1527497^2 + 1391480^2 .
It is a cyclic number.
It is not a de Polignac number, because 4269463675409 - 28 = 4269463675153 is a prime.
It is a super-2 number, since 2×42694636754092 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4269463615409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2134731837704 + 2134731837705.
It is an arithmetic number, because the mean of its divisors is an integer number (2134731837705).
Almost surely, 24269463675409 is an apocalyptic number.
It is an amenable number.
4269463675409 is a deficient number, since it is larger than the sum of its proper divisors (1).
4269463675409 is an equidigital number, since it uses as much as digits as its factorization.
4269463675409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 235146240, while the sum is 65.
The spelling of 4269463675409 in words is "four trillion, two hundred sixty-nine billion, four hundred sixty-three million, six hundred seventy-five thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •