Base | Representation |
---|---|
bin | 1001101101100000000101… |
… | …01100110100110111100111 |
3 | 2210121111000101001200012001 |
4 | 10312300002230310313213 |
5 | 10244333231402413111 |
6 | 113230102255510131 |
7 | 4332551313010444 |
oct | 466600254646747 |
9 | 83544011050161 |
10 | 21354622701031 |
11 | 6893498889a54 |
12 | 248a803b28347 |
13 | bbb969a85b39 |
14 | 53b7d80629cb |
15 | 2707393ca1c1 |
hex | 136c02b34de7 |
21354622701031 has 8 divisors (see below), whose sum is σ = 21566527091424. Its totient is φ = 21142727575200.
The previous prime is 21354622701029. The next prime is 21354622701059. The reversal of 21354622701031 is 13010722645312.
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 21354622701031 - 21 = 21354622701029 is a prime.
It is a super-2 number, since 2×213546227010312 (a number of 27 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 (21354622701011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2363365 + ... + 6949441.
It is an arithmetic number, because the mean of its divisors is an integer number (2695815886428).
Almost surely, 221354622701031 is an apocalyptic number.
21354622701031 is a deficient number, since it is larger than the sum of its proper divisors (211904390393).
21354622701031 is a wasteful number, since it uses less digits than its factorization.
21354622701031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4632281.
The product of its (nonzero) digits is 60480, while the sum is 37.
The spelling of 21354622701031 in words is "twenty-one trillion, three hundred fifty-four billion, six hundred twenty-two million, seven hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •