Base | Representation |
---|---|
bin | 11011101100001110110… |
… | …100011100110110100101 |
3 | 20201220202201002022212011 |
4 | 123230032310130312211 |
5 | 222134134300032241 |
6 | 4014104453154221 |
7 | 254324052556024 |
oct | 33541664346645 |
9 | 6656681068764 |
10 | 1902919142821 |
11 | 674029279a14 |
12 | 26896b92b971 |
13 | 10a5a1768898 |
14 | 6815d3c88bb |
15 | 347751b4281 |
hex | 1bb0ed1cda5 |
1902919142821 has 2 divisors, whose sum is σ = 1902919142822. Its totient is φ = 1902919142820.
The previous prime is 1902919142809. The next prime is 1902919142867. The reversal of 1902919142821 is 1282419192091.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1852282892196 + 50636250625 = 1360986^2 + 225025^2 .
It is a cyclic number.
It is not a de Polignac number, because 1902919142821 - 237 = 1765480189349 is a prime.
It is a super-2 number, since 2×19029191428212 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1902919142921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 951459571410 + 951459571411.
It is an arithmetic number, because the mean of its divisors is an integer number (951459571411).
Almost surely, 21902919142821 is an apocalyptic number.
It is an amenable number.
1902919142821 is a deficient number, since it is larger than the sum of its proper divisors (1).
1902919142821 is an equidigital number, since it uses as much as digits as its factorization.
1902919142821 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 186624, while the sum is 49.
The spelling of 1902919142821 in words is "one trillion, nine hundred two billion, nine hundred nineteen million, one hundred forty-two thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •