Base | Representation |
---|---|
bin | 1101000011111010000101… |
… | …10110001011011110111111 |
3 | 10202200202101102222102222022 |
4 | 12201331002312023132333 |
5 | 12231033232324314143 |
6 | 141030301152310355 |
7 | 6023031140141531 |
oct | 641750266133677 |
9 | 122622342872868 |
10 | 28721567807423 |
11 | 91738262918a7 |
12 | 327a522b423bb |
13 | 130458079354a |
14 | 7141ba3db851 |
15 | 34c1a95b0268 |
hex | 1a1f42d8b7bf |
28721567807423 has 4 divisors (see below), whose sum is σ = 28721579865000. Its totient is φ = 28721555749848.
The previous prime is 28721567807341. The next prime is 28721567807521. The reversal of 28721567807423 is 32470876512782.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 28721567807423 - 216 = 28721567741887 is a prime.
It is a super-2 number, since 2×287215678074232 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (28721567867423) 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, 1127540 + ... + 7662537.
It is an arithmetic number, because the mean of its divisors is an integer number (7180394966250).
Almost surely, 228721567807423 is an apocalyptic number.
28721567807423 is a deficient number, since it is larger than the sum of its proper divisors (12057577).
28721567807423 is an equidigital number, since it uses as much as digits as its factorization.
28721567807423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12057576.
The product of its (nonzero) digits is 63221760, while the sum is 62.
The spelling of 28721567807423 in words is "twenty-eight trillion, seven hundred twenty-one billion, five hundred sixty-seven million, eight hundred seven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •