Base | Representation |
---|---|
bin | 10111100000111110010011… |
… | …111101111010111000100111 |
3 | 111120011221200022100212100122 |
4 | 113200332103331322320213 |
5 | 102023422202000044421 |
6 | 1003542541305232155 |
7 | 30532630535320250 |
oct | 2740762375727047 |
9 | 446157608325318 |
10 | 103421000003111 |
11 | 2aa5366635a41a |
12 | b72382379265b |
13 | 4592734bca50b |
14 | 1b77862d01b27 |
15 | be533e35a2ab |
hex | 5e0f93f7ae27 |
103421000003111 has 16 divisors (see below), whose sum is σ = 118451750141760. Its totient is φ = 88454458149120.
The previous prime is 103421000003107. The next prime is 103421000003117. The reversal of 103421000003111 is 111300000124301.
It is not a de Polignac number, because 103421000003111 - 22 = 103421000003107 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103421000003111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103421000003117) 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, 4379201 + ... + 15033941.
It is an arithmetic number, because the mean of its divisors is an integer number (7403234383860).
Almost surely, 2103421000003111 is an apocalyptic number.
103421000003111 is a deficient number, since it is larger than the sum of its proper divisors (15030750138649).
103421000003111 is a wasteful number, since it uses less digits than its factorization.
103421000003111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10657754.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 103421000003111 its reverse (111300000124301), we get a palindrome (214721000127412).
The spelling of 103421000003111 in words is "one hundred three trillion, four hundred twenty-one billion, three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •