Base | Representation |
---|---|
bin | 110000000110100111… |
… | …0000111101001000111 |
3 | 100212122020002112201021 |
4 | 1200031032013221013 |
5 | 3143030030121411 |
6 | 115242243212011 |
7 | 10314616120123 |
oct | 1401516075107 |
9 | 325566075637 |
10 | 103301020231 |
11 | 3a89a8074a2 |
12 | 1802b377007 |
13 | 998368b256 |
14 | 4ddd624583 |
15 | 2a48e3ea71 |
hex | 180d387a47 |
103301020231 has 8 divisors (see below), whose sum is σ = 103521068928. Its totient is φ = 103081056000.
The previous prime is 103301020213. The next prime is 103301020241. The reversal of 103301020231 is 132020103301.
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 103301020231 - 227 = 103166802503 is a prime.
It is a super-2 number, since 2×1033010202312 (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 (103301020241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2832271 + ... + 2868511.
It is an arithmetic number, because the mean of its divisors is an integer number (12940133616).
Almost surely, 2103301020231 is an apocalyptic number.
103301020231 is a deficient number, since it is larger than the sum of its proper divisors (220048697).
103301020231 is an equidigital number, since it uses as much as digits as its factorization.
103301020231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42233.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 103301020231 its reverse (132020103301), we get a palindrome (235321123532).
The spelling of 103301020231 in words is "one hundred three billion, three hundred one million, twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.366 sec. • engine limits •