Base | Representation |
---|---|
bin | 1001101101110111110000… |
… | …11110101010010011001011 |
3 | 2210122200211101121010212212 |
4 | 10312323320132222103023 |
5 | 10300040301021224301 |
6 | 113240004012255335 |
7 | 4333511336164442 |
oct | 466737036522313 |
9 | 83580741533785 |
10 | 21367336117451 |
11 | 6898922213975 |
12 | 249117177154b |
13 | bbcc1497664c |
14 | 53c28270bd59 |
15 | 270c305bd4bb |
hex | 136ef87aa4cb |
21367336117451 has 8 divisors (see below), whose sum is σ = 21403085937408. Its totient is φ = 21331612368000.
The previous prime is 21367336117433. The next prime is 21367336117531. The reversal of 21367336117451 is 15471163376312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21367336117451 is a prime.
It is a super-2 number, since 2×213673361174512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21367336117451.
It is not an unprimeable number, because it can be changed into a prime (21367336117151) 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, 4876715 + ... + 8155796.
It is an arithmetic number, because the mean of its divisors is an integer number (2675385742176).
Almost surely, 221367336117451 is an apocalyptic number.
21367336117451 is a deficient number, since it is larger than the sum of its proper divisors (35749819957).
21367336117451 is a wasteful number, since it uses less digits than its factorization.
21367336117451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13035253.
The product of its digits is 1905120, while the sum is 50.
The spelling of 21367336117451 in words is "twenty-one trillion, three hundred sixty-seven billion, three hundred thirty-six million, one hundred seventeen thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •