Base | Representation |
---|---|
bin | 110000100101100110… |
… | …1010101001111110101 |
3 | 100222022201000001102010 |
4 | 1201023031111033311 |
5 | 3202142244014310 |
6 | 115533353434433 |
7 | 10352444606460 |
oct | 1411315251765 |
9 | 328281001363 |
10 | 104341001205 |
11 | 40283858601 |
12 | 1827b70ba19 |
13 | 9abac863cc |
14 | 509b7bc2d7 |
15 | 2aaa3bc320 |
hex | 184b3553f5 |
104341001205 has 16 divisors (see below), whose sum is σ = 190794973824. Its totient is φ = 47698743360.
The previous prime is 104341001203. The next prime is 104341001221. The reversal of 104341001205 is 502100143401.
It is not a de Polignac number, because 104341001205 - 21 = 104341001203 is a prime.
It is a super-2 number, since 2×1043410012052 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104341001203) 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, 496861806 + ... + 496862015.
It is an arithmetic number, because the mean of its divisors is an integer number (11924685864).
Almost surely, 2104341001205 is an apocalyptic number.
104341001205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
104341001205 is a deficient number, since it is larger than the sum of its proper divisors (86453972619).
104341001205 is an equidigital number, since it uses as much as digits as its factorization.
104341001205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 993723836.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 104341001205 its reverse (502100143401), we get a palindrome (606441144606).
The spelling of 104341001205 in words is "one hundred four billion, three hundred forty-one million, one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.548 sec. • engine limits •