Base | Representation |
---|---|
bin | 110000011011011101… |
… | …0100011101011101100 |
3 | 100221102222100120221220 |
4 | 1200312322203223230 |
5 | 3200443114112101 |
6 | 115435512223340 |
7 | 10341141651441 |
oct | 1406672435354 |
9 | 327388316856 |
10 | 104000535276 |
11 | 40119655500 |
12 | 181a569ab50 |
13 | 9a6558a991 |
14 | 50684b39c8 |
15 | 2a8a568636 |
hex | 1836ea3aec |
104000535276 has 72 divisors (see below), whose sum is σ = 266923390272. Its totient is φ = 31492956000.
The previous prime is 104000535271. The next prime is 104000535293. The reversal of 104000535276 is 672535000401.
It is a super-2 number, since 2×1040005352762 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (104000535271) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2082171 + ... + 2131533.
Almost surely, 2104000535276 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 104000535276, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133461695136).
104000535276 is an abundant number, since it is smaller than the sum of its proper divisors (162922854996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104000535276 is a wasteful number, since it uses less digits than its factorization.
104000535276 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50843 (or 50830 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 33.
Adding to 104000535276 its reverse (672535000401), we get a palindrome (776535535677).
The spelling of 104000535276 in words is "one hundred four billion, five hundred thirty-five thousand, two hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •