Base | Representation |
---|---|
bin | 10111101001101101000111… |
… | …100110000110001111100011 |
3 | 111122022022102022202200111210 |
4 | 113221231013212012033203 |
5 | 102113240014103024303 |
6 | 1005122332202041203 |
7 | 30624161462144610 |
oct | 2751550746061743 |
9 | 448268368680453 |
10 | 104021014111203 |
11 | 301650787095a2 |
12 | b7bbb771a9203 |
13 | 46071a77573b7 |
14 | 1b98902db9507 |
15 | c05c5a563203 |
hex | 5e9b479863e3 |
104021014111203 has 16 divisors (see below), whose sum is σ = 158528752359680. Its totient is φ = 59432876849376.
The previous prime is 104021014111199. The next prime is 104021014111237. The reversal of 104021014111203 is 302111410120401.
It is not a de Polignac number, because 104021014111203 - 22 = 104021014111199 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
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 104021014111203.
It is not an unprimeable number, because it can be changed into a prime (104021014111283) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 320777533 + ... + 321101646.
It is an arithmetic number, because the mean of its divisors is an integer number (9908047022480).
Almost surely, 2104021014111203 is an apocalyptic number.
104021014111203 is a deficient number, since it is larger than the sum of its proper divisors (54507738248477).
104021014111203 is an equidigital number, since it uses as much as digits as its factorization.
104021014111203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 641886906.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 104021014111203 its reverse (302111410120401), we get a palindrome (406132424231604).
The spelling of 104021014111203 in words is "one hundred four trillion, twenty-one billion, fourteen million, one hundred eleven thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •