Base | Representation |
---|---|
bin | 10111011011001010101110… |
… | …111010000110111010011111 |
3 | 111111202210211201011020100121 |
4 | 113123022232322012322133 |
5 | 102000403044111430421 |
6 | 1003035355043535411 |
7 | 30462044460441010 |
oct | 2733125672067237 |
9 | 444683751136317 |
10 | 103022020030111 |
11 | 2a90a43658a446 |
12 | b67a43608a567 |
13 | 4563c1c9bbb60 |
14 | 1b624143c1007 |
15 | bd9c8c29bd41 |
hex | 5db2aee86e9f |
103022020030111 has 16 divisors (see below), whose sum is σ = 126898835581504. Its totient is φ = 81446032998144.
The previous prime is 103022020030063. The next prime is 103022020030183. The reversal of 103022020030111 is 111030020220301.
It is a cyclic number.
It is not a de Polignac number, because 103022020030111 - 27 = 103022020029983 is a prime.
It is a super-2 number, since 2×1030220200301112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103022020030211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 457490550 + ... + 457715683.
It is an arithmetic number, because the mean of its divisors is an integer number (7931177223844).
Almost surely, 2103022020030111 is an apocalyptic number.
103022020030111 is a deficient number, since it is larger than the sum of its proper divisors (23876815551393).
103022020030111 is a wasteful number, since it uses less digits than its factorization.
103022020030111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 915207490.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 103022020030111 its reverse (111030020220301), we get a palindrome (214052040250412).
The spelling of 103022020030111 in words is "one hundred three trillion, twenty-two billion, twenty million, thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •