Base | Representation |
---|---|
bin | 110000011011011101… |
… | …0100000011110010111 |
3 | 100221102222022220221012 |
4 | 1200312322200132113 |
5 | 3200443113202020 |
6 | 115435512042435 |
7 | 10341141565226 |
oct | 1406672403627 |
9 | 327388286835 |
10 | 104000522135 |
11 | 40119646644 |
12 | 181a569341b |
13 | 9a655849c3 |
14 | 50684accbd |
15 | 2a8a5647c5 |
hex | 1836ea0797 |
104000522135 has 8 divisors (see below), whose sum is σ = 124802712816. Its totient is φ = 83199026880.
The previous prime is 104000522117. The next prime is 104000522147. The reversal of 104000522135 is 531225000401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104000522135 - 210 = 104000521111 is a prime.
It is a super-2 number, since 2×1040005221352 (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 104000522135.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 248387 + ... + 519323.
It is an arithmetic number, because the mean of its divisors is an integer number (15600339102).
Almost surely, 2104000522135 is an apocalyptic number.
104000522135 is a deficient number, since it is larger than the sum of its proper divisors (20802190681).
104000522135 is an equidigital number, since it uses as much as digits as its factorization.
104000522135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347713.
The product of its (nonzero) digits is 1200, while the sum is 23.
Adding to 104000522135 its reverse (531225000401), we get a palindrome (635225522536).
The spelling of 104000522135 in words is "one hundred four billion, five hundred twenty-two thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •