Base | Representation |
---|---|
bin | 101111111110010101… |
… | …0101101010111011111 |
3 | 100211220212112000001222 |
4 | 1133330222231113133 |
5 | 3141442431131421 |
6 | 115154522523555 |
7 | 10305004422242 |
oct | 1377452552737 |
9 | 324825460058 |
10 | 103023302111 |
11 | 3a767a71794 |
12 | 17b723665bb |
13 | 993ac923c2 |
14 | 4db47b1259 |
15 | 2a2e882cab |
hex | 17fcaad5df |
103023302111 has 8 divisors (see below), whose sum is σ = 106581711600. Its totient is φ = 99465284800.
The previous prime is 103023302089. The next prime is 103023302113. The reversal of 103023302111 is 111203320301.
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-103023302111 is a prime.
It is a super-2 number, since 2×1030233021112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103023302111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103023302113) 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, 497900 + ... + 673758.
It is an arithmetic number, because the mean of its divisors is an integer number (13322713950).
Almost surely, 2103023302111 is an apocalyptic number.
103023302111 is a deficient number, since it is larger than the sum of its proper divisors (3558409489).
103023302111 is a wasteful number, since it uses less digits than its factorization.
103023302111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 196089.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 103023302111 its reverse (111203320301), we get a palindrome (214226622412).
The spelling of 103023302111 in words is "one hundred three billion, twenty-three million, three hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •