Base | Representation |
---|---|
bin | 110000100110000011… |
… | …0100111111100110101 |
3 | 100222100202021002100120 |
4 | 1201030012213330311 |
5 | 3202210120120041 |
6 | 115535051402153 |
7 | 10353016351221 |
oct | 1411406477465 |
9 | 328322232316 |
10 | 104356020021 |
11 | 40291286450 |
12 | 18284753359 |
13 | 9ac1114496 |
14 | 509d7ab781 |
15 | 2aab887366 |
hex | 184c1a7f35 |
104356020021 has 128 divisors (see below), whose sum is σ = 172113984000. Its totient is φ = 55480320000.
The previous prime is 104356020017. The next prime is 104356020107. The reversal of 104356020021 is 120020653401.
It is not a de Polignac number, because 104356020021 - 22 = 104356020017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 104356019973 and 104356020000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104356020221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 67369155 + ... + 67370703.
It is an arithmetic number, because the mean of its divisors is an integer number (1344640500).
Almost surely, 2104356020021 is an apocalyptic number.
104356020021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
104356020021 is a deficient number, since it is larger than the sum of its proper divisors (67757963979).
104356020021 is a wasteful number, since it uses less digits than its factorization.
104356020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1751.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 104356020021 its reverse (120020653401), we get a palindrome (224376673422).
The spelling of 104356020021 in words is "one hundred four billion, three hundred fifty-six million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.919 sec. • engine limits •