Base | Representation |
---|---|
bin | 1000101011101011001010… |
… | …10110110100000100110001 |
3 | 2111121020221011021021100222 |
4 | 10111311211112310010301 |
5 | 10000304104002010001 |
6 | 104335043003022425 |
7 | 4010261062131644 |
oct | 425654526640461 |
9 | 74536834237328 |
10 | 19092830110001 |
11 | 60a125093681a |
12 | 218439a20aa15 |
13 | a865a527a78b |
14 | 4a0152933a5b |
15 | 2319ad18261b |
hex | 115d655b4131 |
19092830110001 has 4 divisors (see below), whose sum is σ = 19751203562100. Its totient is φ = 18434456657904.
The previous prime is 19092830109931. The next prime is 19092830110021. The reversal of 19092830110001 is 10001103829091.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5428340814400 + 13664489295601 = 2329880^2 + 3696551^2 .
It is a cyclic number.
It is not a de Polignac number, because 19092830110001 - 234 = 19075650240817 is a prime.
It is not an unprimeable number, because it can be changed into a prime (19092830110021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 329186726006 + ... + 329186726063.
It is an arithmetic number, because the mean of its divisors is an integer number (4937800890525).
Almost surely, 219092830110001 is an apocalyptic number.
It is an amenable number.
19092830110001 is a deficient number, since it is larger than the sum of its proper divisors (658373452099).
19092830110001 is an equidigital number, since it uses as much as digits as its factorization.
19092830110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 658373452098.
The product of its (nonzero) digits is 3888, while the sum is 35.
Adding to 19092830110001 its reverse (10001103829091), we get a palindrome (29093933939092).
The spelling of 19092830110001 in words is "nineteen trillion, ninety-two billion, eight hundred thirty million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •