Base | Representation |
---|---|
bin | 10000111000110… |
… | …01010110110101 |
3 | 100212120011012201 |
4 | 20130121112311 |
5 | 242231132441 |
6 | 22020144501 |
7 | 3340050433 |
oct | 1034312665 |
9 | 325504181 |
10 | 141661621 |
11 | 72a67522 |
12 | 3b538131 |
13 | 2346c75a |
14 | 14b57d53 |
15 | c683c31 |
hex | 87195b5 |
141661621 has 2 divisors, whose sum is σ = 141661622. Its totient is φ = 141661620.
The previous prime is 141661589. The next prime is 141661631. The reversal of 141661621 is 126166141.
141661621 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., 114725521 + 26936100 = 10711^2 + 5190^2 .
It is an emirp because it is prime and its reverse (126166141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141661621 - 25 = 141661589 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 141661621.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141661631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70830810 + 70830811.
It is an arithmetic number, because the mean of its divisors is an integer number (70830811).
Almost surely, 2141661621 is an apocalyptic number.
It is an amenable number.
141661621 is a deficient number, since it is larger than the sum of its proper divisors (1).
141661621 is an equidigital number, since it uses as much as digits as its factorization.
141661621 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1728, while the sum is 28.
The square root of 141661621 is about 11902.1687519544. The cubic root of 141661621 is about 521.2956116792.
The spelling of 141661621 in words is "one hundred forty-one million, six hundred sixty-one thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •