Base | Representation |
---|---|
bin | 1000110001001011100010… |
… | …11010101011001111010001 |
3 | 2112021100020111111201202222 |
4 | 10120211301122223033101 |
5 | 10011404024304310001 |
6 | 105002011130150425 |
7 | 4030036131220235 |
oct | 430456132531721 |
9 | 75240214451688 |
10 | 19282011010001 |
11 | 6164500596a63 |
12 | 21b4b96582415 |
13 | a9b393c9ca1c |
14 | 4a937bb945c5 |
15 | 23688189c61b |
hex | 1189716ab3d1 |
19282011010001 has 4 divisors (see below), whose sum is σ = 19282020899952. Its totient is φ = 19282001120052.
The previous prime is 19282011009959. The next prime is 19282011010027. The reversal of 19282011010001 is 10001011028291.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-19282011010001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (19282011010051) 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, 938411 + ... + 6280496.
It is an arithmetic number, because the mean of its divisors is an integer number (4820505224988).
Almost surely, 219282011010001 is an apocalyptic number.
It is an amenable number.
19282011010001 is a deficient number, since it is larger than the sum of its proper divisors (9889951).
19282011010001 is an equidigital number, since it uses as much as digits as its factorization.
19282011010001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9889950.
The product of its (nonzero) digits is 288, while the sum is 26.
Adding to 19282011010001 its reverse (10001011028291), we get a palindrome (29283022038292).
The spelling of 19282011010001 in words is "nineteen trillion, two hundred eighty-two billion, eleven million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •