Base | Representation |
---|---|
bin | 110000000100010010… |
… | …1000010101001101001 |
3 | 100212102210112222021000 |
4 | 1200020211002221221 |
5 | 3142400111034032 |
6 | 115230422105213 |
7 | 10312652144631 |
oct | 1401045025151 |
9 | 325383488230 |
10 | 103223143017 |
11 | 3a85a856165 |
12 | 1800927b209 |
13 | 99704c2167 |
14 | 4dd31516c1 |
15 | 2a421a9e7c |
hex | 1808942a69 |
103223143017 has 64 divisors (see below), whose sum is σ = 159728670720. Its totient is φ = 65808288000.
The previous prime is 103223142983. The next prime is 103223143021. The reversal of 103223143017 is 710341322301.
It is a happy number.
103223143017 is a `hidden beast` number, since 1 + 0 + 3 + 223 + 1 + 430 + 1 + 7 = 666.
It is not a de Polignac number, because 103223143017 - 27 = 103223142889 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (103223143717) 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 63 ways as a sum of consecutive naturals, for example, 63993703 + ... + 63995315.
It is an arithmetic number, because the mean of its divisors is an integer number (2495760480).
Almost surely, 2103223143017 is an apocalyptic number.
It is an amenable number.
103223143017 is a deficient number, since it is larger than the sum of its proper divisors (56505527703).
103223143017 is a wasteful number, since it uses less digits than its factorization.
103223143017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2511 (or 2505 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
Adding to 103223143017 its reverse (710341322301), we get a palindrome (813564465318).
The spelling of 103223143017 in words is "one hundred three billion, two hundred twenty-three million, one hundred forty-three thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •