Base | Representation |
---|---|
bin | 1100111001110001110001… |
… | …10001101000010011010001 |
3 | 10201110110222110012121100001 |
4 | 12130320320301220103101 |
5 | 12204332420130212401 |
6 | 140202335310330001 |
7 | 5655626640600655 |
oct | 634707061502321 |
9 | 121413873177301 |
10 | 28373506491601 |
11 | 904a15579a687 |
12 | 3222b85ab9901 |
13 | 12aa7c175142b |
14 | 7013dc222a65 |
15 | 3430d785b601 |
hex | 19ce38c684d1 |
28373506491601 has 8 divisors (see below), whose sum is σ = 28420409878560. Its totient is φ = 28326611728992.
The previous prime is 28373506491593. The next prime is 28373506491623. The reversal of 28373506491601 is 10619460537382.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 28373506491601 - 23 = 28373506491593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (28373506495601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4445901 + ... + 8747173.
It is an arithmetic number, because the mean of its divisors is an integer number (3552551234820).
It is a 2-persistent number, because it is pandigital, and so is 2⋅28373506491601 = 56747012983202, but 3⋅28373506491601 = 85120519474803 is not.
Almost surely, 228373506491601 is an apocalyptic number.
It is an amenable number.
28373506491601 is a deficient number, since it is larger than the sum of its proper divisors (46903386959).
28373506491601 is a wasteful number, since it uses less digits than its factorization.
28373506491601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4312175.
The product of its (nonzero) digits is 6531840, while the sum is 55.
The spelling of 28373506491601 in words is "twenty-eight trillion, three hundred seventy-three billion, five hundred six million, four hundred ninety-one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •