Base | Representation |
---|---|
bin | 110000011101100111… |
… | …1011100110101101010 |
3 | 100221122000221100000212 |
4 | 1200323033130311222 |
5 | 3201120204334010 |
6 | 115451024101122 |
7 | 10343012635136 |
oct | 1407317346552 |
9 | 327560840025 |
10 | 104073121130 |
11 | 40156622310 |
12 | 18205a647a2 |
13 | 9a776234a4 |
14 | 5073daa3c6 |
15 | 2a91b05505 |
hex | 183b3dcd6a |
104073121130 has 32 divisors (see below), whose sum is σ = 213247064448. Its totient is φ = 36199345600.
The previous prime is 104073121067. The next prime is 104073121133. The reversal of 104073121130 is 31121370401.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a junction number, because it is equal to n+sod(n) for n = 104073121096 and 104073121105.
It is not an unprimeable number, because it can be changed into a prime (104073121133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20565281 + ... + 20570340.
It is an arithmetic number, because the mean of its divisors is an integer number (6663970764).
Almost surely, 2104073121130 is an apocalyptic number.
104073121130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104073121130 is an abundant number, since it is smaller than the sum of its proper divisors (109173943318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104073121130 is a wasteful number, since it uses less digits than its factorization.
104073121130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41135662.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 104073121130 its reverse (31121370401), we get a palindrome (135194491531).
The spelling of 104073121130 in words is "one hundred four billion, seventy-three million, one hundred twenty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •