Base | Representation |
---|---|
bin | 10000111000011… |
… | …11011011000101 |
3 | 100212111002101202 |
4 | 20130033123011 |
5 | 242223332213 |
6 | 22015232245 |
7 | 3336521006 |
oct | 1034173305 |
9 | 325432352 |
10 | 141620933 |
11 | 72a399a3 |
12 | 3b518685 |
13 | 2345708c |
14 | 14b471ad |
15 | c676b58 |
hex | 870f6c5 |
141620933 has 2 divisors, whose sum is σ = 141620934. Its totient is φ = 141620932.
The previous prime is 141620923. The next prime is 141620939. The reversal of 141620933 is 339026141.
141620933 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., 104080804 + 37540129 = 10202^2 + 6127^2 .
It is a cyclic number.
It is not a de Polignac number, because 141620933 - 210 = 141619909 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 141620896 and 141620905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141620939) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70810466 + 70810467.
It is an arithmetic number, because the mean of its divisors is an integer number (70810467).
Almost surely, 2141620933 is an apocalyptic number.
It is an amenable number.
141620933 is a deficient number, since it is larger than the sum of its proper divisors (1).
141620933 is an equidigital number, since it uses as much as digits as its factorization.
141620933 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 29.
The square root of 141620933 is about 11900.4593608818. The cubic root of 141620933 is about 521.2456981206.
The spelling of 141620933 in words is "one hundred forty-one million, six hundred twenty thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •