Base | Representation |
---|---|
bin | 1001010111100110100101… |
… | …1110101010100011010111 |
3 | 1100110202221110022011022022 |
4 | 2111321221132222203113 |
5 | 2322233123403101403 |
6 | 33524132141123355 |
7 | 2112141614453006 |
oct | 225715136524327 |
9 | 40422843264268 |
10 | 10301101222103 |
11 | 33117440aa82a |
12 | 11a4509b5955b |
13 | 59950b175133 |
14 | 27880c60ac3d |
15 | 12ce4e129d38 |
hex | 95e697aa8d7 |
10301101222103 has 8 divisors (see below), whose sum is σ = 10331048028000. Its totient is φ = 10271156878368.
The previous prime is 10301101222081. The next prime is 10301101222127. The reversal of 10301101222103 is 30122210110301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10301101222103 - 224 = 10301084444887 is a prime.
It is a super-2 number, since 2×103011012221032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10301101222303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7936550 + ... + 9142812.
It is an arithmetic number, because the mean of its divisors is an integer number (1291381003500).
Almost surely, 210301101222103 is an apocalyptic number.
10301101222103 is a deficient number, since it is larger than the sum of its proper divisors (29946805897).
10301101222103 is a wasteful number, since it uses less digits than its factorization.
10301101222103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1231081.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10301101222103 its reverse (30122210110301), we get a palindrome (40423311332404).
The spelling of 10301101222103 in words is "ten trillion, three hundred one billion, one hundred one million, two hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •