Base | Representation |
---|---|
bin | 10111011011010100001001… |
… | …101000100110110000101011 |
3 | 111111210202221102210202212112 |
4 | 113123110021220212300223 |
5 | 102001034301304300321 |
6 | 1003044150312432535 |
7 | 30462553165600463 |
oct | 2733241150466053 |
9 | 444722842722775 |
10 | 103032132103211 |
11 | 2a913755591653 |
12 | b6803986a874b |
13 | 4564b7198916c |
14 | 1b62ad3398ba3 |
15 | bda17ede6a5b |
hex | 5db509a26c2b |
103032132103211 has 8 divisors (see below), whose sum is σ = 104449447614384. Its totient is φ = 101614976496000.
The previous prime is 103032132103207. The next prime is 103032132103217. The reversal of 103032132103211 is 112301231230301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103032132103211 - 22 = 103032132103207 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103032132103217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38678165 + ... + 41256086.
It is an arithmetic number, because the mean of its divisors is an integer number (13056180951798).
Almost surely, 2103032132103211 is an apocalyptic number.
103032132103211 is a deficient number, since it is larger than the sum of its proper divisors (1417315511173).
103032132103211 is an equidigital number, since it uses as much as digits as its factorization.
103032132103211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79951981.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 103032132103211 its reverse (112301231230301), we get a palindrome (215333363333512).
The spelling of 103032132103211 in words is "one hundred three trillion, thirty-two billion, one hundred thirty-two million, one hundred three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •