Base | Representation |
---|---|
bin | 101110100101001100… |
… | …1111001110011111111 |
3 | 100120012102220011110102 |
4 | 1131022121321303333 |
5 | 3114331313132231 |
6 | 113542044431315 |
7 | 10140620443565 |
oct | 1351231716377 |
9 | 316172804412 |
10 | 100032552191 |
11 | 3947284a040 |
12 | 1747884853b |
13 | 95824992b0 |
14 | 4bad4d5a35 |
15 | 2907019acb |
hex | 174a679cff |
100032552191 has 8 divisors (see below), whose sum is σ = 117520760784. Its totient is φ = 83943400320.
The previous prime is 100032552161. The next prime is 100032552247. The reversal of 100032552191 is 191255230001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100032552191 - 26 = 100032552127 is a prime.
It is a super-2 number, since 2×1000325521912 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100032552161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 349764026 + ... + 349764311.
It is an arithmetic number, because the mean of its divisors is an integer number (14690095098).
Almost surely, 2100032552191 is an apocalyptic number.
100032552191 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100032552191 is a deficient number, since it is larger than the sum of its proper divisors (17488208593).
100032552191 is a wasteful number, since it uses less digits than its factorization.
100032552191 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 699528361.
The product of its (nonzero) digits is 2700, while the sum is 29.
Adding to 100032552191 its reverse (191255230001), we get a palindrome (291287782192).
The spelling of 100032552191 in words is "one hundred billion, thirty-two million, five hundred fifty-two thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •