Base | Representation |
---|---|
bin | 10111011100010011101010… |
… | …100111111100000011000101 |
3 | 111112001021222100122111122110 |
4 | 113130103222213330003011 |
5 | 102003143434303430201 |
6 | 1003135345514251233 |
7 | 30500516215364112 |
oct | 2734235247740305 |
9 | 445037870574573 |
10 | 103100331311301 |
11 | 2a93a672229045 |
12 | b691650426b19 |
13 | 456b41ccc716c |
14 | 1b66122b6d909 |
15 | bdbd223946d6 |
hex | 5dc4ea9fc0c5 |
103100331311301 has 32 divisors (see below), whose sum is σ = 145661672331648. Its totient is φ = 64642294384640.
The previous prime is 103100331311261. The next prime is 103100331311311. The reversal of 103100331311301 is 103113133001301.
It is a cyclic number.
It is not a de Polignac number, because 103100331311301 - 221 = 103100329214149 is a prime.
It is a super-4 number, since 4×1031003313113014 (a number of 57 digits) contains 4444 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103100331311311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1003250761 + ... + 1003353521.
It is an arithmetic number, because the mean of its divisors is an integer number (4551927260364).
Almost surely, 2103100331311301 is an apocalyptic number.
It is an amenable number.
103100331311301 is a deficient number, since it is larger than the sum of its proper divisors (42561341020347).
103100331311301 is a wasteful number, since it uses less digits than its factorization.
103100331311301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117221.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 103100331311301 its reverse (103113133001301), we get a palindrome (206213464312602).
The spelling of 103100331311301 in words is "one hundred three trillion, one hundred billion, three hundred thirty-one million, three hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •