Base | Representation |
---|---|
bin | 1100111010111001111110… |
… | …00001010101111001010001 |
3 | 10201121012000200000121002220 |
4 | 12131130333001111321101 |
5 | 12211001310042320343 |
6 | 140232225332531253 |
7 | 5661501303033225 |
oct | 635347701257121 |
9 | 121535020017086 |
10 | 28412265979473 |
11 | 9064635491592 |
12 | 322a5a2480b29 |
13 | 12b135a7c683c |
14 | 703237b56785 |
15 | 3441054a4183 |
hex | 19d73f055e51 |
28412265979473 has 32 divisors (see below), whose sum is σ = 41098710528000. Its totient is φ = 17405303420736.
The previous prime is 28412265979459. The next prime is 28412265979477. The reversal of 28412265979473 is 37497956221482.
It is not a de Polignac number, because 28412265979473 - 29 = 28412265978961 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (69).
It is a junction number, because it is equal to n+sod(n) for n = 28412265979398 and 28412265979407.
It is not an unprimeable number, because it can be changed into a prime (28412265979477) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35277765 + ... + 36074162.
It is an arithmetic number, because the mean of its divisors is an integer number (1284334704000).
Almost surely, 228412265979473 is an apocalyptic number.
28412265979473 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
28412265979473 is a deficient number, since it is larger than the sum of its proper divisors (12686444548527).
28412265979473 is a wasteful number, since it uses less digits than its factorization.
28412265979473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71352181.
The product of its digits is 365783040, while the sum is 69.
The spelling of 28412265979473 in words is "twenty-eight trillion, four hundred twelve billion, two hundred sixty-five million, nine hundred seventy-nine thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •