Base | Representation |
---|---|
bin | 1000101001000011010011… |
… | …10010100110011110110000 |
3 | 2111021122022112201222221010 |
4 | 10110201221302212132300 |
5 | 4442320022302040000 |
6 | 104225420300230520 |
7 | 4000620605346255 |
oct | 424415162463660 |
9 | 74248275658833 |
10 | 19002710190000 |
11 | 6067005558a99 |
12 | 216aa2923b440 |
13 | a7ac4265bb24 |
14 | 499a43b3b42c |
15 | 22e486518d50 |
hex | 114869ca67b0 |
19002710190000 has 100 divisors (see below), whose sum is σ = 61343282284856. Its totient is φ = 5067389376000.
The previous prime is 19002710189977. The next prime is 19002710190029. The reversal of 19002710190000 is 9101720091.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×190027101900002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a self number, because there is not a number n which added to its sum of digits gives 19002710190000.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 316681837 + ... + 316741836.
Almost surely, 219002710190000 is an apocalyptic number.
19002710190000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
19002710190000 is an abundant number, since it is smaller than the sum of its proper divisors (42340572094856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19002710190000 is an equidigital number, since it uses as much as digits as its factorization.
19002710190000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 633423704 (or 633423683 counting only the distinct ones).
The product of its (nonzero) digits is 1134, while the sum is 30.
The spelling of 19002710190000 in words is "nineteen trillion, two billion, seven hundred ten million, one hundred ninety thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •