Base | Representation |
---|---|
bin | 110001000011110011… |
… | …0011000001111010101 |
3 | 101001221022111212220012 |
4 | 1202013212120033111 |
5 | 3211231133400041 |
6 | 120222110050005 |
7 | 10416526632050 |
oct | 1420746301725 |
9 | 331838455805 |
10 | 105354200021 |
11 | 407537768a4 |
12 | 18502aa9905 |
13 | 9c1cb65135 |
14 | 51561a3a97 |
15 | 2b193093eb |
hex | 18879983d5 |
105354200021 has 8 divisors (see below), whose sum is σ = 124556689920. Its totient is φ = 87189682608.
The previous prime is 105354199999. The next prime is 105354200027. The reversal of 105354200021 is 120002453501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105354200021 - 26 = 105354199957 is a prime.
It is a super-2 number, since 2×1053542000212 (a number of 23 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 105354200021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105354200027) 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, 259492901 + ... + 259493306.
It is an arithmetic number, because the mean of its divisors is an integer number (15569586240).
Almost surely, 2105354200021 is an apocalyptic number.
It is an amenable number.
105354200021 is a deficient number, since it is larger than the sum of its proper divisors (19202489899).
105354200021 is an equidigital number, since it uses as much as digits as its factorization.
105354200021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 518986243.
The product of its (nonzero) digits is 1200, while the sum is 23.
Adding to 105354200021 its reverse (120002453501), we get a palindrome (225356653522).
The spelling of 105354200021 in words is "one hundred five billion, three hundred fifty-four million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •