Base | Representation |
---|---|
bin | 10111011100010100011000… |
… | …101000001100101010110001 |
3 | 111112001100222010222000122211 |
4 | 113130110120220030222301 |
5 | 102003202024400200223 |
6 | 1003135554245132121 |
7 | 30500544306632200 |
oct | 2734243050145261 |
9 | 445040863860584 |
10 | 103101103131313 |
11 | 2a93aa28971921 |
12 | b6918269ba041 |
13 | 456b513b915b1 |
14 | 1b66197481237 |
15 | bdbd6a001d0d |
hex | 5dc518a0cab1 |
103101103131313 has 24 divisors (see below), whose sum is σ = 120186556833600. Its totient is φ = 88186281811488.
The previous prime is 103101103131289. The next prime is 103101103131317. The reversal of 103101103131313 is 313131301101301.
It is not a de Polignac number, because 103101103131313 - 233 = 103092513196721 is a prime.
It is a super-2 number, since 2×1031011031313132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103101103131317) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 178263906 + ... + 178841332.
It is an arithmetic number, because the mean of its divisors is an integer number (5007773201400).
Almost surely, 2103101103131313 is an apocalyptic number.
It is an amenable number.
103101103131313 is a deficient number, since it is larger than the sum of its proper divisors (17085453702287).
103101103131313 is an equidigital number, since it uses as much as digits as its factorization.
103101103131313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 585109 (or 585102 counting only the distinct ones).
The product of its (nonzero) digits is 243, while the sum is 22.
Adding to 103101103131313 its reverse (313131301101301), we get a palindrome (416232404232614).
The spelling of 103101103131313 in words is "one hundred three trillion, one hundred one billion, one hundred three million, one hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •