Base | Representation |
---|---|
bin | 10111011101111010000110… |
… | …100001110100001000010101 |
3 | 111112102210212201220102112012 |
4 | 113131322012201310020111 |
5 | 102011444214202242401 |
6 | 1003302100022034005 |
7 | 30511461654426326 |
oct | 2735720641641025 |
9 | 445383781812465 |
10 | 103210321134101 |
11 | 2a982284657945 |
12 | b6aaa27878905 |
13 | 45788cb36c94c |
14 | 1b6b59886444d |
15 | bdeb0d62b8bb |
hex | 5dde86874215 |
103210321134101 has 16 divisors (see below), whose sum is σ = 103491618439680. Its totient is φ = 102929446710000.
The previous prime is 103210321134079. The next prime is 103210321134113. The reversal of 103210321134101 is 101431123012301.
It is a cyclic number.
It is not a de Polignac number, because 103210321134101 - 210 = 103210321133077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103210321034101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6842816906 + ... + 6842831988.
It is an arithmetic number, because the mean of its divisors is an integer number (6468226152480).
Almost surely, 2103210321134101 is an apocalyptic number.
It is an amenable number.
103210321134101 is a deficient number, since it is larger than the sum of its proper divisors (281297305579).
103210321134101 is a wasteful number, since it uses less digits than its factorization.
103210321134101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27896.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 103210321134101 its reverse (101431123012301), we get a palindrome (204641444146402).
The spelling of 103210321134101 in words is "one hundred three trillion, two hundred ten billion, three hundred twenty-one million, one hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •