Base | Representation |
---|---|
bin | 1000101001010100110100… |
… | …00100110101010010100011 |
3 | 2111022112120122112111111211 |
4 | 10110222122010311102203 |
5 | 4442443300203211321 |
6 | 104234013131250551 |
7 | 4001402546245066 |
oct | 424523204652243 |
9 | 74275518474454 |
10 | 19012110210211 |
11 | 606aa99629338 |
12 | 21708112a9a57 |
13 | a7baacc59971 |
14 | 49a2963208dd |
15 | 22e8368b00e1 |
hex | 114a9a1354a3 |
19012110210211 has 8 divisors (see below), whose sum is σ = 19039211879184. Its totient is φ = 18985027841760.
The previous prime is 19012110210209. The next prime is 19012110210307. The reversal of 19012110210211 is 11201201121091.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 19012110210211 - 21 = 19012110210209 is a prime.
It is a super-2 number, since 2×190121102102112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (19012110210311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2853040 + ... + 6794413.
It is an arithmetic number, because the mean of its divisors is an integer number (2379901484898).
Almost surely, 219012110210211 is an apocalyptic number.
19012110210211 is a deficient number, since it is larger than the sum of its proper divisors (27101668973).
19012110210211 is a wasteful number, since it uses less digits than its factorization.
19012110210211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9650261.
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 19012110210211 in words is "nineteen trillion, twelve billion, one hundred ten million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •