Base | Representation |
---|---|
bin | 101111111110010011… |
… | …0001010100100101101 |
3 | 100211220210021111012112 |
4 | 1133330212022210231 |
5 | 3141442130023041 |
6 | 115154441213405 |
7 | 10304661331544 |
oct | 1377446124455 |
9 | 324823244175 |
10 | 103022111021 |
11 | 3a767328915 |
12 | 17b71a91265 |
13 | 993a96620b |
14 | 4db458115b |
15 | 2a2e6e9deb |
hex | 17fc98a92d |
103022111021 has 8 divisors (see below), whose sum is σ = 105423071424. Its totient is φ = 100621382400.
The previous prime is 103022110967. The next prime is 103022111029. The reversal of 103022111021 is 120111220301.
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 103022111021 - 210 = 103022109997 is a prime.
It is a super-2 number, since 2×1030221110212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103022110987 and 103022111005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103022111029) 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, 1114445 + ... + 1203341.
It is an arithmetic number, because the mean of its divisors is an integer number (13177883928).
Almost surely, 2103022111021 is an apocalyptic number.
It is an amenable number.
103022111021 is a deficient number, since it is larger than the sum of its proper divisors (2400960403).
103022111021 is an equidigital number, since it uses as much as digits as its factorization.
103022111021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115891.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 103022111021 its reverse (120111220301), we get a palindrome (223133331322).
The spelling of 103022111021 in words is "one hundred three billion, twenty-two million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •