Base | Representation |
---|---|
bin | 1100101111000000000001… |
… | …10010001100001001110101 |
3 | 10200011002011011002001000012 |
4 | 12113200000302030021311 |
5 | 12132301023140130101 |
6 | 135320254211430005 |
7 | 5620110253665113 |
oct | 627400062141165 |
9 | 120132134061005 |
10 | 28003199926901 |
11 | 8a170aa353761 |
12 | 318325abb5305 |
13 | 12818c8b1c364 |
14 | 6cb50d8a6ab3 |
15 | 338662bd2bbb |
hex | 197800c8c275 |
28003199926901 has 2 divisors, whose sum is σ = 28003199926902. Its totient is φ = 28003199926900.
The previous prime is 28003199926883. The next prime is 28003199926903. The reversal of 28003199926901 is 10962999130082.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21998867187025 + 6004332739876 = 4690295^2 + 2450374^2 .
It is a cyclic number.
It is not a de Polignac number, because 28003199926901 - 222 = 28003195732597 is a prime.
It is a super-2 number, since 2×280031999269012 (a number of 28 digits) contains 22 as substring.
Together with 28003199926903, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (28003199926903) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14001599963450 + 14001599963451.
It is an arithmetic number, because the mean of its divisors is an integer number (14001599963451).
Almost surely, 228003199926901 is an apocalyptic number.
It is an amenable number.
28003199926901 is a deficient number, since it is larger than the sum of its proper divisors (1).
28003199926901 is an equidigital number, since it uses as much as digits as its factorization.
28003199926901 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3779136, while the sum is 59.
The spelling of 28003199926901 in words is "twenty-eight trillion, three billion, one hundred ninety-nine million, nine hundred twenty-six thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •