Base | Representation |
---|---|
bin | 110000000110111100… |
… | …1001001110010101111 |
3 | 100212200000022200100002 |
4 | 1200031321021302233 |
5 | 3143040422114411 |
6 | 115243325054515 |
7 | 10315114033256 |
oct | 1401571116257 |
9 | 325600280302 |
10 | 103312301231 |
11 | 3a8a6112037 |
12 | 180330b743b |
13 | 9985b0abb9 |
14 | 5000d1d79d |
15 | 2a49e1c33b |
hex | 180de49caf |
103312301231 has 4 divisors (see below), whose sum is σ = 103347965952. Its totient is φ = 103276636512.
The previous prime is 103312301207. The next prime is 103312301269. The reversal of 103312301231 is 132103213301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103312301231 - 214 = 103312284847 is a prime.
It is a super-2 number, since 2×1033123012312 (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 (103312301831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17828015 + ... + 17833808.
It is an arithmetic number, because the mean of its divisors is an integer number (25836991488).
Almost surely, 2103312301231 is an apocalyptic number.
103312301231 is a deficient number, since it is larger than the sum of its proper divisors (35664721).
103312301231 is an equidigital number, since it uses as much as digits as its factorization.
103312301231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35664720.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 103312301231 its reverse (132103213301), we get a palindrome (235415514532).
The spelling of 103312301231 in words is "one hundred three billion, three hundred twelve million, three hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.862 sec. • engine limits •