Base | Representation |
---|---|
bin | 101111111110010001… |
… | …1011101101111100111 |
3 | 100211220201221112010122 |
4 | 1133330203131233213 |
5 | 3141441434344421 |
6 | 115154414112155 |
7 | 10304652322634 |
oct | 1377443355747 |
9 | 324821845118 |
10 | 103021403111 |
11 | 3a766994a70 |
12 | 17b717ab65b |
13 | 993a778c33 |
14 | 4db443918b |
15 | 2a2e60a2ab |
hex | 17fc8ddbe7 |
103021403111 has 16 divisors (see below), whose sum is σ = 112671014688. Its totient is φ = 93419443200.
The previous prime is 103021403063. The next prime is 103021403267. The reversal of 103021403111 is 111304120301.
It is not a de Polignac number, because 103021403111 - 210 = 103021402087 is a prime.
It is a super-2 number, since 2×1030214031112 (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 103021403111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103021403011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7334351 + ... + 7348383.
It is an arithmetic number, because the mean of its divisors is an integer number (7041938418).
Almost surely, 2103021403111 is an apocalyptic number.
103021403111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
103021403111 is a deficient number, since it is larger than the sum of its proper divisors (9649611577).
103021403111 is a wasteful number, since it uses less digits than its factorization.
103021403111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15682.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 103021403111 its reverse (111304120301), we get a palindrome (214325523412).
The spelling of 103021403111 in words is "one hundred three billion, twenty-one million, four hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •