Base | Representation |
---|---|
bin | 1000001111111… |
… | …01101001110001 |
3 | 11211012112121200 |
4 | 10013331221301 |
5 | 120203241101 |
6 | 10511041413 |
7 | 1500105531 |
oct | 407755161 |
9 | 154175550 |
10 | 69196401 |
11 | 3607230a |
12 | 1b210269 |
13 | 11449b21 |
14 | 92934c1 |
15 | 611c986 |
hex | 41fda71 |
69196401 has 12 divisors (see below), whose sum is σ = 102652212. Its totient is φ = 44883936.
The previous prime is 69196399. The next prime is 69196403. The reversal of 69196401 is 10469196.
69196401 is a `hidden beast` number, since 6 + 9 + 1 + 9 + 640 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (69196399) and next prime (69196403).
It can be written as a sum of positive squares in 2 ways, for example, as 64786401 + 4410000 = 8049^2 + 2100^2 .
It is not a de Polignac number, because 69196401 - 21 = 69196399 is a prime.
It is a super-2 number, since 2×691964012 = 9576283822705602, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (69196403) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 103566 + ... + 104231.
It is an arithmetic number, because the mean of its divisors is an integer number (8554351).
Almost surely, 269196401 is an apocalyptic number.
It is an amenable number.
69196401 is a deficient number, since it is larger than the sum of its proper divisors (33455811).
69196401 is a wasteful number, since it uses less digits than its factorization.
69196401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207840 (or 207837 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 36.
The square root of 69196401 is about 8318.4374133608. The cubic root of 69196401 is about 410.5453797100.
The spelling of 69196401 in words is "sixty-nine million, one hundred ninety-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •