Base | Representation |
---|---|
bin | 10000110110110… |
… | …11000010011001 |
3 | 100212002012001122 |
4 | 20123123002121 |
5 | 242200000421 |
6 | 22010455025 |
7 | 3334635305 |
oct | 1033330231 |
9 | 325065048 |
10 | 141406361 |
11 | 72902768 |
12 | 3b434475 |
13 | 233b0505 |
14 | 14accd05 |
15 | c6332ab |
hex | 86db099 |
141406361 has 2 divisors, whose sum is σ = 141406362. Its totient is φ = 141406360.
The previous prime is 141406339. The next prime is 141406367. The reversal of 141406361 is 163604141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87310336 + 54096025 = 9344^2 + 7355^2 .
It is a cyclic number.
It is not a de Polignac number, because 141406361 - 222 = 137212057 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 141406361.
It is not a weakly prime, because it can be changed into another prime (141406367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70703180 + 70703181.
It is an arithmetic number, because the mean of its divisors is an integer number (70703181).
Almost surely, 2141406361 is an apocalyptic number.
It is an amenable number.
141406361 is a deficient number, since it is larger than the sum of its proper divisors (1).
141406361 is an equidigital number, since it uses as much as digits as its factorization.
141406361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
The square root of 141406361 is about 11891.4406612487. The cubic root of 141406361 is about 520.9823159990.
The spelling of 141406361 in words is "one hundred forty-one million, four hundred six thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •