Base | Representation |
---|---|
bin | 110000011100001110… |
… | …0100001011100100111 |
3 | 100221111202200022121101 |
4 | 1200320130201130213 |
5 | 3201021202404411 |
6 | 115442230500531 |
7 | 10341603151150 |
oct | 1407034413447 |
9 | 327452608541 |
10 | 104026216231 |
11 | 401320a5a33 |
12 | 181b2204747 |
13 | 9a6a9acb02 |
14 | 506ba7a927 |
15 | 2a8c93c8c1 |
hex | 1838721727 |
104026216231 has 16 divisors (see below), whose sum is σ = 120971934720. Its totient is φ = 87608553120.
The previous prime is 104026216207. The next prime is 104026216271. The reversal of 104026216231 is 132612620401.
It is a cyclic number.
It is not a de Polignac number, because 104026216231 - 211 = 104026214183 is a prime.
It is a super-2 number, since 2×1040262162312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 104026216231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104026216271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 102655 + ... + 467536.
It is an arithmetic number, because the mean of its divisors is an integer number (7560745920).
Almost surely, 2104026216231 is an apocalyptic number.
104026216231 is a deficient number, since it is larger than the sum of its proper divisors (16945718489).
104026216231 is an equidigital number, since it uses as much as digits as its factorization.
104026216231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570654.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 104026216231 its reverse (132612620401), we get a palindrome (236638836632).
The spelling of 104026216231 in words is "one hundred four billion, twenty-six million, two hundred sixteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •