Base | Representation |
---|---|
bin | 10010010010000000… |
… | …010101010101111101 |
3 | 1212200000020100222011 |
4 | 102102000111111331 |
5 | 310200113231031 |
6 | 13003450451221 |
7 | 1263302255206 |
oct | 222200252575 |
9 | 55600210864 |
10 | 19629430141 |
11 | 8363335442 |
12 | 3979a33b11 |
13 | 1b0a99bb29 |
14 | d42dc25ad |
15 | 79d46c6b1 |
hex | 49201557d |
19629430141 has 2 divisors, whose sum is σ = 19629430142. Its totient is φ = 19629430140.
The previous prime is 19629430127. The next prime is 19629430153. The reversal of 19629430141 is 14103492691.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10326827641 + 9302602500 = 101621^2 + 96450^2 .
It is a cyclic number.
It is not a de Polignac number, because 19629430141 - 29 = 19629429629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 19629430094 and 19629430103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (19629430111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9814715070 + 9814715071.
It is an arithmetic number, because the mean of its divisors is an integer number (9814715071).
Almost surely, 219629430141 is an apocalyptic number.
It is an amenable number.
19629430141 is a deficient number, since it is larger than the sum of its proper divisors (1).
19629430141 is an equidigital number, since it uses as much as digits as its factorization.
19629430141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 40.
The spelling of 19629430141 in words is "nineteen billion, six hundred twenty-nine million, four hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •