Base | Representation |
---|---|
bin | 110000000111010001… |
… | …0000101101010100111 |
3 | 100212200202111212111112 |
4 | 1200032202011222213 |
5 | 3143101144012411 |
6 | 115244351055235 |
7 | 10315304166056 |
oct | 1401642055247 |
9 | 325622455445 |
10 | 103323032231 |
11 | 3a901181431 |
12 | 1803681151b |
13 | 99880c73c3 |
14 | 500251439d |
15 | 2a4ad3bb8b |
hex | 180e885aa7 |
103323032231 has 8 divisors (see below), whose sum is σ = 103728507120. Its totient is φ = 102918314752.
The previous prime is 103323032207. The next prime is 103323032233. The reversal of 103323032231 is 132230323301.
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 103323032231 - 26 = 103323032167 is a prime.
It is a super-2 number, since 2×1033230322312 (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 = 103323032197 and 103323032206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103323032233) 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, 84791 + ... + 462423.
It is an arithmetic number, because the mean of its divisors is an integer number (12966063390).
Almost surely, 2103323032231 is an apocalyptic number.
103323032231 is a deficient number, since it is larger than the sum of its proper divisors (405474889).
103323032231 is an equidigital number, since it uses as much as digits as its factorization.
103323032231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 378705.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 103323032231 its reverse (132230323301), we get a palindrome (235553355532).
The spelling of 103323032231 in words is "one hundred three billion, three hundred twenty-three million, thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •