Base | Representation |
---|---|
bin | 101110100111010011… |
… | …1110111000111011111 |
3 | 100120101101001112200112 |
4 | 1131032213313013133 |
5 | 3120002422220111 |
6 | 113553053320235 |
7 | 10142440116041 |
oct | 1351647670737 |
9 | 316341045615 |
10 | 100103320031 |
11 | 394a9794a60 |
12 | 1749849607b |
13 | 9594046460 |
14 | 4bb8a77a91 |
15 | 290d347e8b |
hex | 174e9f71df |
100103320031 has 32 divisors (see below), whose sum is σ = 123035867136. Its totient is φ = 80210016000.
The previous prime is 100103319989. The next prime is 100103320043. The reversal of 100103320031 is 130023301001.
It is a cyclic number.
It is not a de Polignac number, because 100103320031 - 210 = 100103319007 is a prime.
It is a super-2 number, since 2×1001033200312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100103319988 and 100103320015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100103320091) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 93926 + ... + 457196.
It is an arithmetic number, because the mean of its divisors is an integer number (3844870848).
Almost surely, 2100103320031 is an apocalyptic number.
100103320031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100103320031 is a deficient number, since it is larger than the sum of its proper divisors (22932547105).
100103320031 is a wasteful number, since it uses less digits than its factorization.
100103320031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 363383.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 100103320031 its reverse (130023301001), we get a palindrome (230126621032).
The spelling of 100103320031 in words is "one hundred billion, one hundred three million, three hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •