Base | Representation |
---|---|
bin | 110000000000101011… |
… | …1000000010101100011 |
3 | 100212010100122102211212 |
4 | 1200001113000111203 |
5 | 3142123104214021 |
6 | 115210414100335 |
7 | 10306651510241 |
oct | 1400127002543 |
9 | 325110572755 |
10 | 103102023011 |
11 | 3a7a8449989 |
12 | 17b947aa6ab |
13 | 9951395510 |
14 | 4dc1023791 |
15 | 2a3673285b |
hex | 18015c0563 |
103102023011 has 8 divisors (see below), whose sum is σ = 117564297984. Its totient is φ = 89572798080.
The previous prime is 103102023001. The next prime is 103102023061. The reversal of 103102023011 is 110320201301.
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 103102023011 - 222 = 103097828707 is a prime.
It is a super-3 number, since 3×1031020230113 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103102023001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 233262275 + ... + 233262716.
It is an arithmetic number, because the mean of its divisors is an integer number (14695537248).
Almost surely, 2103102023011 is an apocalyptic number.
103102023011 is a deficient number, since it is larger than the sum of its proper divisors (14462274973).
103102023011 is a wasteful number, since it uses less digits than its factorization.
103102023011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466525021.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 103102023011 its reverse (110320201301), we get a palindrome (213422224312).
The spelling of 103102023011 in words is "one hundred three billion, one hundred two million, twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •