Base | Representation |
---|---|
bin | 1001010111101001111110… |
… | …1101111111110101011111 |
3 | 1100110212021212121101112121 |
4 | 2111322133231333311133 |
5 | 2322242004332223403 |
6 | 33524402325243411 |
7 | 2112203304314113 |
oct | 225723755776537 |
9 | 40425255541477 |
10 | 10302011211103 |
11 | 3312070834a57 |
12 | 11a4722863567 |
13 | 599624858371 |
14 | 278897407743 |
15 | 12cea3e7b3bd |
hex | 95e9fb7fd5f |
10302011211103 has 8 divisors (see below), whose sum is σ = 10349554410000. Its totient is φ = 10254496461888.
The previous prime is 10302011211097. The next prime is 10302011211133. The reversal of 10302011211103 is 30111211020301.
It is a happy number.
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 10302011211103 - 29 = 10302011210591 is a prime.
It is a super-2 number, since 2×103020112111032 (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 (10302011211133) 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, 6386353 + ... + 7835146.
It is an arithmetic number, because the mean of its divisors is an integer number (1293694301250).
Almost surely, 210302011211103 is an apocalyptic number.
10302011211103 is a deficient number, since it is larger than the sum of its proper divisors (47543198897).
10302011211103 is a wasteful number, since it uses less digits than its factorization.
10302011211103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14224841.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10302011211103 its reverse (30111211020301), we get a palindrome (40413222231404).
The spelling of 10302011211103 in words is "ten trillion, three hundred two billion, eleven million, two hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.192 sec. • engine limits •