Base | Representation |
---|---|
bin | 101011101110… |
… | …010001100001 |
3 | 210120022112111 |
4 | 223232101201 |
5 | 10413233404 |
6 | 1045355321 |
7 | 166265056 |
oct | 53562141 |
9 | 23508474 |
10 | 11461729 |
11 | 6519404 |
12 | 3a08b41 |
13 | 24b3cb6 |
14 | 174502d |
15 | 1016104 |
hex | aee461 |
11461729 has 2 divisors, whose sum is σ = 11461730. Its totient is φ = 11461728.
The previous prime is 11461663. The next prime is 11461741. The reversal of 11461729 is 92716411.
11461729 is digitally balanced in base 2, 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., 11404129 + 57600 = 3377^2 + 240^2 .
It is an emirp because it is prime and its reverse (92716411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11461729 - 213 = 11453537 is a prime.
It is equal to p754942 and since 11461729 and 754942 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11461729.
It is not a weakly prime, because it can be changed into another prime (11461789) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5730864 + 5730865.
It is an arithmetic number, because the mean of its divisors is an integer number (5730865).
Almost surely, 211461729 is an apocalyptic number.
It is an amenable number.
11461729 is a deficient number, since it is larger than the sum of its proper divisors (1).
11461729 is an equidigital number, since it uses as much as digits as its factorization.
11461729 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3024, while the sum is 31.
The square root of 11461729 is about 3385.5175379844. The cubic root of 11461729 is about 225.4672036840.
The spelling of 11461729 in words is "eleven million, four hundred sixty-one thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •