Base | Representation |
---|---|
bin | 10010010001100010… |
… | …000011000110111101 |
3 | 1212122110022000200211 |
4 | 102101202003012331 |
5 | 310141100204013 |
6 | 13003004352421 |
7 | 1263144631336 |
oct | 222142030675 |
9 | 55573260624 |
10 | 19621491133 |
11 | 8359902782 |
12 | 3977245711 |
13 | 1b0914c3aa |
14 | d41d1728d |
15 | 79c90023d |
hex | 4918831bd |
19621491133 has 2 divisors, whose sum is σ = 19621491134. Its totient is φ = 19621491132.
The previous prime is 19621491091. The next prime is 19621491161. The reversal of 19621491133 is 33119412691.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15015561444 + 4605929689 = 122538^2 + 67867^2 .
It is an emirp because it is prime and its reverse (33119412691) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 19621491133 - 213 = 19621482941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (19621491433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9810745566 + 9810745567.
It is an arithmetic number, because the mean of its divisors is an integer number (9810745567).
Almost surely, 219621491133 is an apocalyptic number.
It is an amenable number.
19621491133 is a deficient number, since it is larger than the sum of its proper divisors (1).
19621491133 is an equidigital number, since it uses as much as digits as its factorization.
19621491133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34992, while the sum is 40.
The spelling of 19621491133 in words is "nineteen billion, six hundred twenty-one million, four hundred ninety-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •