Base | Representation |
---|---|
bin | 101111111110010001… |
… | …1001100111011010111 |
3 | 100211220201211000122112 |
4 | 1133330203030323113 |
5 | 3141441430143411 |
6 | 115154412421235 |
7 | 10304651615054 |
oct | 1377443147327 |
9 | 324821730575 |
10 | 103021334231 |
11 | 3a766948242 |
12 | 17b7177781b |
13 | 993a75378a |
14 | 4db441c02b |
15 | 2a2e5e4b8b |
hex | 17fc8cced7 |
103021334231 has 8 divisors (see below), whose sum is σ = 104772474240. Its totient is φ = 101270361528.
The previous prime is 103021334203. The next prime is 103021334233. The reversal of 103021334231 is 132433120301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103021334231 is a prime.
It is a super-2 number, since 2×1030213342312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103021334197 and 103021334206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103021334233) 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, 2389790 + ... + 2432516.
It is an arithmetic number, because the mean of its divisors is an integer number (13096559280).
Almost surely, 2103021334231 is an apocalyptic number.
103021334231 is a deficient number, since it is larger than the sum of its proper divisors (1751140009).
103021334231 is an equidigital number, since it uses as much as digits as its factorization.
103021334231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83653.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 103021334231 its reverse (132433120301), we get a palindrome (235454454532).
The spelling of 103021334231 in words is "one hundred three billion, twenty-one million, three hundred thirty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •