Base | Representation |
---|---|
bin | 101111111110100100… |
… | …1010000111010010101 |
3 | 100211221102120221121022 |
4 | 1133331021100322111 |
5 | 3142002003441041 |
6 | 115155410330525 |
7 | 10305132462611 |
oct | 1377511207225 |
9 | 324842527538 |
10 | 103031312021 |
11 | 3a771542750 |
12 | 17b74b89a45 |
13 | 993c8381b1 |
14 | 4db5898341 |
15 | 2a3041624b |
hex | 17fd250e95 |
103031312021 has 8 divisors (see below), whose sum is σ = 119009430144. Its totient is φ = 88155133120.
The previous prime is 103031311993. The next prime is 103031312039. The reversal of 103031312021 is 120213130301.
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 103031312021 - 210 = 103031310997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103031312051) 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, 275484605 + ... + 275484978.
It is an arithmetic number, because the mean of its divisors is an integer number (14876178768).
Almost surely, 2103031312021 is an apocalyptic number.
103031312021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
103031312021 is a deficient number, since it is larger than the sum of its proper divisors (15978118123).
103031312021 is a wasteful number, since it uses less digits than its factorization.
103031312021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550969611.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 103031312021 its reverse (120213130301), we get a palindrome (223244442322).
The spelling of 103031312021 in words is "one hundred three billion, thirty-one million, three hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •