Base | Representation |
---|---|
bin | 110000010000110111… |
… | …1001001100001110111 |
3 | 100220112012202212012010 |
4 | 1200201233021201313 |
5 | 3144231134114111 |
6 | 115340340455303 |
7 | 10326265600620 |
oct | 1404157114167 |
9 | 326465685163 |
10 | 103645223031 |
11 | 3aa57032119 |
12 | 181066aa533 |
13 | 9a09a9484c |
14 | 5033222a47 |
15 | 2a69280aa6 |
hex | 1821bc9877 |
103645223031 has 8 divisors (see below), whose sum is σ = 157935577984. Its totient is φ = 59225841720.
The previous prime is 103645222999. The next prime is 103645223053. The reversal of 103645223031 is 130322546301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103645223031 - 25 = 103645222999 is a prime.
It is a super-2 number, since 2×1036452230312 (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 103645223031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103645223131) 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, 2467743385 + ... + 2467743426.
It is an arithmetic number, because the mean of its divisors is an integer number (19741947248).
Almost surely, 2103645223031 is an apocalyptic number.
103645223031 is a deficient number, since it is larger than the sum of its proper divisors (54290354953).
103645223031 is an equidigital number, since it uses as much as digits as its factorization.
103645223031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4935486821.
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 103645223031 its reverse (130322546301), we get a palindrome (233967769332).
The spelling of 103645223031 in words is "one hundred three billion, six hundred forty-five million, two hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •