Base | Representation |
---|---|
bin | 110000000000101001… |
… | …1111100100010010011 |
3 | 100212010022010200201011 |
4 | 1200001103330202103 |
5 | 3142122403033021 |
6 | 115210344551351 |
7 | 10306641630115 |
oct | 1400123744223 |
9 | 325108120634 |
10 | 103101221011 |
11 | 3a7a7a51378 |
12 | 17b94482557 |
13 | 9951174469 |
14 | 4dc0c953b5 |
15 | 2a36624de1 |
hex | 18014fc893 |
103101221011 has 8 divisors (see below), whose sum is σ = 104818841264. Its totient is φ = 101384485920.
The previous prime is 103101220967. The next prime is 103101221033. The reversal of 103101221011 is 110122101301.
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 103101221011 - 217 = 103101089939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103101220982 and 103101221000.
It is not an unprimeable number, because it can be changed into a prime (103101221081) 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, 15700 + ... + 454366.
It is an arithmetic number, because the mean of its divisors is an integer number (13102355158).
Almost surely, 2103101221011 is an apocalyptic number.
103101221011 is a deficient number, since it is larger than the sum of its proper divisors (1717620253).
103101221011 is an equidigital number, since it uses as much as digits as its factorization.
103101221011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442581.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 103101221011 its reverse (110122101301), we get a palindrome (213223322312).
It can be divided in two parts, 10310 and 1221011, that added together give a palindrome (1231321).
The spelling of 103101221011 in words is "one hundred three billion, one hundred one million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •