Base | Representation |
---|---|
bin | 110000000111100000… |
… | …1101111110011111011 |
3 | 100212201100010111201022 |
4 | 1200033001233303323 |
5 | 3143110310100243 |
6 | 115245245013055 |
7 | 10315434552503 |
oct | 1401701576373 |
9 | 325640114638 |
10 | 103331331323 |
11 | 3a90592a690 |
12 | 1803955418b |
13 | 9989a419cc |
14 | 5003674a03 |
15 | 2a4b92ab68 |
hex | 180f06fcfb |
103331331323 has 8 divisors (see below), whose sum is σ = 114635684160. Its totient is φ = 92345411080.
The previous prime is 103331331209. The next prime is 103331331371. The reversal of 103331331323 is 323133133301.
It is a happy number.
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 103331331323 - 228 = 103062895867 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103331331292 and 103331331301.
It is not an unprimeable number, because it can be changed into a prime (103331336323) 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, 79607465 + ... + 79608762.
It is an arithmetic number, because the mean of its divisors is an integer number (14329460520).
Almost surely, 2103331331323 is an apocalyptic number.
103331331323 is a deficient number, since it is larger than the sum of its proper divisors (11304352837).
103331331323 is a wasteful number, since it uses less digits than its factorization.
103331331323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159216297.
The product of its (nonzero) digits is 4374, while the sum is 26.
Adding to 103331331323 its reverse (323133133301), we get a palindrome (426464464624).
It can be divided in two parts, 10 and 3331331323, that added together give a palindrome (3331331333).
The spelling of 103331331323 in words is "one hundred three billion, three hundred thirty-one million, three hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •