Base | Representation |
---|---|
bin | 10000000100010011010… |
… | …011010011001010110110 |
3 | 10220112221202011220202020 |
4 | 100010103103103022312 |
5 | 121042224341441210 |
6 | 2203121442454010 |
7 | 142525244505351 |
oct | 20042323231266 |
9 | 3815852156666 |
10 | 1104130421430 |
11 | 396293924823 |
12 | 159ba3064306 |
13 | 8017173221a |
14 | 3b623c8b298 |
15 | 1dac33d9770 |
hex | 101134d32b6 |
1104130421430 has 16 divisors (see below), whose sum is σ = 2649913011504. Its totient is φ = 294434779040.
The previous prime is 1104130421411. The next prime is 1104130421447. The reversal of 1104130421430 is 341240314011.
It is a self number, because there is not a number n which added to its sum of digits gives 1104130421430.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 18402173661 + ... + 18402173720.
It is an arithmetic number, because the mean of its divisors is an integer number (165619563219).
Almost surely, 21104130421430 is an apocalyptic number.
1104130421430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1104130421430 is an abundant number, since it is smaller than the sum of its proper divisors (1545782590074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1104130421430 is a wasteful number, since it uses less digits than its factorization.
1104130421430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36804347391.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 1104130421430 its reverse (341240314011), we get a palindrome (1445370735441).
The spelling of 1104130421430 in words is "one trillion, one hundred four billion, one hundred thirty million, four hundred twenty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •