Base | Representation |
---|---|
bin | 1001100110001111111010… |
… | …01101001010000110100111 |
3 | 2202201122210011202020202002 |
4 | 10303013331031022012213 |
5 | 10231242401114111101 |
6 | 112515410332435515 |
7 | 4305550020333242 |
oct | 463077515120647 |
9 | 82648704666662 |
10 | 21105422410151 |
11 | 67a7839808032 |
12 | 244a457318b9b |
13 | ba13045a7611 |
14 | 52d717942259 |
15 | 2690018cbd6b |
hex | 1331fd34a1a7 |
21105422410151 has 4 divisors (see below), whose sum is σ = 21125165556600. Its totient is φ = 21085679263704.
The previous prime is 21105422410133. The next prime is 21105422410271. The reversal of 21105422410151 is 15101422450112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21105422410151 - 26 = 21105422410087 is a prime.
It is a super-2 number, since 2×211054224101512 (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 (21105422410451) 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, 9871571621 + ... + 9871573758.
It is an arithmetic number, because the mean of its divisors is an integer number (5281291389150).
Almost surely, 221105422410151 is an apocalyptic number.
21105422410151 is a deficient number, since it is larger than the sum of its proper divisors (19743146449).
21105422410151 is a wasteful number, since it uses less digits than its factorization.
21105422410151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19743146448.
The product of its (nonzero) digits is 3200, while the sum is 29.
Adding to 21105422410151 its reverse (15101422450112), we get a palindrome (36206844860263).
The spelling of 21105422410151 in words is "twenty-one trillion, one hundred five billion, four hundred twenty-two million, four hundred ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •