Base | Representation |
---|---|
bin | 1001100101000011000011… |
… | …11011101011011101001111 |
3 | 2202120201021201020110201112 |
4 | 10302201201323223131033 |
5 | 10230103401114412111 |
6 | 112444424233002235 |
7 | 4302556405234130 |
oct | 462414173533517 |
9 | 82521251213645 |
10 | 21064162654031 |
11 | 6791296749632 |
12 | 244246155337b |
13 | b9a45a53a943 |
14 | 52b721d2bc87 |
15 | 267dd9503e8b |
hex | 132861eeb74f |
21064162654031 has 8 divisors (see below), whose sum is σ = 24195528387360. Its totient is φ = 17963346830688.
The previous prime is 21064162654013. The next prime is 21064162654043. The reversal of 21064162654031 is 13045626146012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21064162654031 - 226 = 21064095545167 is a prime.
It is a super-2 number, since 2×210641626540312 (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 21064162654031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21064162654081) 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, 7637476016 + ... + 7637478773.
It is an arithmetic number, because the mean of its divisors is an integer number (3024441048420).
Almost surely, 221064162654031 is an apocalyptic number.
21064162654031 is a deficient number, since it is larger than the sum of its proper divisors (3131365733329).
21064162654031 is a wasteful number, since it uses less digits than its factorization.
21064162654031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15274954993.
The product of its (nonzero) digits is 207360, while the sum is 41.
The spelling of 21064162654031 in words is "twenty-one trillion, sixty-four billion, one hundred sixty-two million, six hundred fifty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •