Base | Representation |
---|---|
bin | 1000101100011111100000… |
… | …01111110011100000111101 |
3 | 2111200221110111101011001012 |
4 | 10112033300033303200331 |
5 | 10001234131102001001 |
6 | 104400011203325005 |
7 | 4012304321156513 |
oct | 426176017634075 |
9 | 74627414334035 |
10 | 19120930109501 |
11 | 6102160624300 |
12 | 2189920980765 |
13 | a89132b0ba0c |
14 | 4a165a8b44b3 |
15 | 2325a509d2bb |
hex | 1163f03f383d |
19120930109501 has 24 divisors (see below), whose sum is σ = 22152178180440. Its totient is φ = 16466596065920.
The previous prime is 19120930109497. The next prime is 19120930109507. The reversal of 19120930109501 is 10590103902191.
It can be written as a sum of positive squares in 4 ways, for example, as 559257187225 + 18561672922276 = 747835^2 + 4308326^2 .
It is not a de Polignac number, because 19120930109501 - 22 = 19120930109497 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19120930109507) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 51220730 + ... + 51592683.
It is an arithmetic number, because the mean of its divisors is an integer number (923007424185).
Almost surely, 219120930109501 is an apocalyptic number.
19120930109501 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
19120930109501 is a deficient number, since it is larger than the sum of its proper divisors (3031248070939).
19120930109501 is a wasteful number, since it uses less digits than its factorization.
19120930109501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102813517 (or 102813506 counting only the distinct ones).
The product of its (nonzero) digits is 21870, while the sum is 41.
The spelling of 19120930109501 in words is "nineteen trillion, one hundred twenty billion, nine hundred thirty million, one hundred nine thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •