Base | Representation |
---|---|
bin | 110000011011011110… |
… | …1100001110101010010 |
3 | 100221110000211011100100 |
4 | 1200312331201311102 |
5 | 3200443314023010 |
6 | 115435541033230 |
7 | 10341151404240 |
oct | 1406675416522 |
9 | 327400734310 |
10 | 104001314130 |
11 | 4011a03768a |
12 | 181a59b5816 |
13 | 9a657a133c |
14 | 5068637790 |
15 | 2a8a66e2c0 |
hex | 1836f61d52 |
104001314130 has 48 divisors (see below), whose sum is σ = 309032478144. Its totient is φ = 23771728800.
The previous prime is 104001314113. The next prime is 104001314203. The reversal of 104001314130 is 31413100401.
104001314130 is a `hidden beast` number, since 1 + 0 + 400 + 131 + 4 + 130 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
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 23 ways as a sum of consecutive naturals, for example, 82540096 + ... + 82541355.
It is an arithmetic number, because the mean of its divisors is an integer number (6438176628).
Almost surely, 2104001314130 is an apocalyptic number.
104001314130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104001314130 is an abundant number, since it is smaller than the sum of its proper divisors (205031164014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104001314130 is a wasteful number, since it uses less digits than its factorization.
104001314130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165081471 (or 165081468 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 104001314130 its reverse (31413100401), we get a palindrome (135414414531).
The spelling of 104001314130 in words is "one hundred four billion, one million, three hundred fourteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •