Base | Representation |
---|---|
bin | 101110110010011011… |
… | …0110000000101010010 |
3 | 100121100100221000101002 |
4 | 1131210312300011102 |
5 | 3121233414302010 |
6 | 114054100142002 |
7 | 10154616434522 |
oct | 1354466600522 |
9 | 317310830332 |
10 | 100476322130 |
11 | 3968029aa58 |
12 | 17581397902 |
13 | 96233c4362 |
14 | 4c12411682 |
15 | 2930e771a5 |
hex | 1764db0152 |
100476322130 has 16 divisors (see below), whose sum is σ = 191496049560. Its totient is φ = 37826380032.
The previous prime is 100476322109. The next prime is 100476322151. The reversal of 100476322130 is 31223674001.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (100476322109) and next prime (100476322151).
It can be written as a sum of positive squares in 4 ways, for example, as 90018600961 + 10457721169 = 300031^2 + 102263^2 .
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 100476322093 and 100476322102.
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, 295518425 + ... + 295518764.
Almost surely, 2100476322130 is an apocalyptic number.
100476322130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100476322130 is a deficient number, since it is larger than the sum of its proper divisors (91019727430).
100476322130 is a wasteful number, since it uses less digits than its factorization.
100476322130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 591037213.
The product of its (nonzero) digits is 6048, while the sum is 29.
Adding to 100476322130 its reverse (31223674001), we get a palindrome (131699996131).
The spelling of 100476322130 in words is "one hundred billion, four hundred seventy-six million, three hundred twenty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •