Base | Representation |
---|---|
bin | 10111011011000000110001… |
… | …010100111111010111110101 |
3 | 111111201210020020012122021020 |
4 | 113123000301110333113311 |
5 | 102000214142220311201 |
6 | 1003030425410011353 |
7 | 30461215422133116 |
oct | 2733006124772765 |
9 | 444653206178236 |
10 | 103011323213301 |
11 | 2a9059474aa678 |
12 | b67834b876b59 |
13 | 4562c06838159 |
14 | 1b61abb8b220d |
15 | bd9863149a36 |
hex | 5db03153f5f5 |
103011323213301 has 24 divisors (see below), whose sum is σ = 143580952737600. Its totient is φ = 65687825064576.
The previous prime is 103011323213167. The next prime is 103011323213353. The reversal of 103011323213301 is 103312323110301.
It is not a de Polignac number, because 103011323213301 - 215 = 103011323180533 is a prime.
It is a super-2 number, since 2×1030113232133012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103011323203301) 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, 274123600 + ... + 274499126.
It is an arithmetic number, because the mean of its divisors is an integer number (5982539697400).
Almost surely, 2103011323213301 is an apocalyptic number.
It is an amenable number.
103011323213301 is a deficient number, since it is larger than the sum of its proper divisors (40569629524299).
103011323213301 is a wasteful number, since it uses less digits than its factorization.
103011323213301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 548425 (or 548402 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 103011323213301 its reverse (103312323110301), we get a palindrome (206323646323602).
The spelling of 103011323213301 in words is "one hundred three trillion, eleven billion, three hundred twenty-three million, two hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •