Base | Representation |
---|---|
bin | 110000011101001111… |
… | …1110000111010010001 |
3 | 100221121011102020022002 |
4 | 1200322133300322101 |
5 | 3201104004323213 |
6 | 115445500123345 |
7 | 10342501452020 |
oct | 1407237607221 |
9 | 327534366262 |
10 | 104060620433 |
11 | 4014a564360 |
12 | 18201836555 |
13 | 9a74b67623 |
14 | 50724748b7 |
15 | 2a90986658 |
hex | 183a7f0e91 |
104060620433 has 32 divisors (see below), whose sum is σ = 133065918720. Its totient is φ = 79011072000.
The previous prime is 104060620399. The next prime is 104060620451. The reversal of 104060620433 is 334026060401.
It is not a de Polignac number, because 104060620433 - 28 = 104060620177 is a prime.
It is a super-2 number, since 2×1040606204332 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 104060620396 and 104060620405.
It is not an unprimeable number, because it can be changed into a prime (104060620333) 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 31 ways as a sum of consecutive naturals, for example, 2597273 + ... + 2637033.
It is an arithmetic number, because the mean of its divisors is an integer number (4158309960).
Almost surely, 2104060620433 is an apocalyptic number.
It is an amenable number.
104060620433 is a deficient number, since it is larger than the sum of its proper divisors (29005298287).
104060620433 is a wasteful number, since it uses less digits than its factorization.
104060620433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40649.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 104060620433 its reverse (334026060401), we get a palindrome (438086680834).
The spelling of 104060620433 in words is "one hundred four billion, sixty million, six hundred twenty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •