Base | Representation |
---|---|
bin | 10111011100010011011100… |
… | …111010100011101010000110 |
3 | 111112001021101022212021200212 |
4 | 113130103130322203222012 |
5 | 102003143001413423420 |
6 | 1003135311020435422 |
7 | 30500510423410451 |
oct | 2734233472435206 |
9 | 445037338767625 |
10 | 103100101311110 |
11 | 2a93a564415542 |
12 | b6915a73a8b72 |
13 | 456b3b4467a87 |
14 | 1b661003bc498 |
15 | bdbd0c0b13c5 |
hex | 5dc4dcea3a86 |
103100101311110 has 16 divisors (see below), whose sum is σ = 196496663675616. Its totient is φ = 38814155787648.
The previous prime is 103100101311107. The next prime is 103100101311167. The reversal of 103100101311110 is 11113101001301.
It is a super-2 number, since 2×1031001013111102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 303235591922 + ... + 303235592261.
It is an arithmetic number, because the mean of its divisors is an integer number (12281041479726).
Almost surely, 2103100101311110 is an apocalyptic number.
103100101311110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103100101311110 is a deficient number, since it is larger than the sum of its proper divisors (93396562364506).
103100101311110 is a wasteful number, since it uses less digits than its factorization.
103100101311110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 606471184207.
The product of its (nonzero) digits is 9, while the sum is 14.
Adding to 103100101311110 its reverse (11113101001301), we get a palindrome (114213202312411).
The spelling of 103100101311110 in words is "one hundred three trillion, one hundred billion, one hundred one million, three hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •