Base | Representation |
---|---|
bin | 1100110101011111100011… |
… | …00001000010110100010001 |
3 | 10200221101222010111020211221 |
4 | 12122233301201002310101 |
5 | 12144424411202321421 |
6 | 140010550332205041 |
7 | 5642165403644551 |
oct | 632576141026421 |
9 | 120841863436757 |
10 | 28226282073361 |
11 | 8aa2776411159 |
12 | 31ba538909781 |
13 | 129995b22ca58 |
14 | 6d823333b161 |
15 | 33e36c791841 |
hex | 19abf1842d11 |
28226282073361 has 4 divisors (see below), whose sum is σ = 28490079102192. Its totient is φ = 27962485044532.
The previous prime is 28226282073347. The next prime is 28226282073419. The reversal of 28226282073361 is 16337028262282.
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.
It is a cyclic number.
It is not a de Polignac number, because 28226282073361 - 235 = 28191922334993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 28226282073299 and 28226282073308.
It is not an unprimeable number, because it can be changed into a prime (28226282077361) 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, 131898514255 + ... + 131898514468.
It is an arithmetic number, because the mean of its divisors is an integer number (7122519775548).
Almost surely, 228226282073361 is an apocalyptic number.
It is an amenable number.
28226282073361 is a deficient number, since it is larger than the sum of its proper divisors (263797028831).
28226282073361 is a wasteful number, since it uses less digits than its factorization.
28226282073361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263797028830.
The product of its (nonzero) digits is 4644864, while the sum is 52.
The spelling of 28226282073361 in words is "twenty-eight trillion, two hundred twenty-six billion, two hundred eighty-two million, seventy-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •