Base | Representation |
---|---|
bin | 101111111110010001… |
… | …0011011100011111111 |
3 | 100211220201102202021122 |
4 | 1133330202123203333 |
5 | 3141441402211111 |
6 | 115154404221155 |
7 | 10304650113416 |
oct | 1377442334377 |
9 | 324821382248 |
10 | 103021132031 |
11 | 3a76681a334 |
12 | 17b7169a7bb |
13 | 993a6b272c |
14 | 4db43a847d |
15 | 2a2e5a4cdb |
hex | 17fc89b8ff |
103021132031 has 4 divisors (see below), whose sum is σ = 103471006200. Its totient is φ = 102571257864.
The previous prime is 103021131977. The next prime is 103021132033. The reversal of 103021132031 is 130231120301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 130231120301 = 71 ⋅1834241131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103021132031 is a prime.
It is a super-2 number, since 2×1030211320312 (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 (103021132033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 224936741 + ... + 224937198.
It is an arithmetic number, because the mean of its divisors is an integer number (25867751550).
Almost surely, 2103021132031 is an apocalyptic number.
103021132031 is a deficient number, since it is larger than the sum of its proper divisors (449874169).
103021132031 is an equidigital number, since it uses as much as digits as its factorization.
103021132031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 449874168.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 103021132031 its reverse (130231120301), we get a palindrome (233252252332).
The spelling of 103021132031 in words is "one hundred three billion, twenty-one million, one hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •