Base | Representation |
---|---|
bin | 1001011110101001110011… |
… | …0010010111101101010111 |
3 | 1100220100120111201222100002 |
4 | 2113222130302113231113 |
5 | 2331224202101010403 |
6 | 34055522520441515 |
7 | 2123660232513005 |
oct | 227523462275527 |
9 | 40810514658302 |
10 | 10422221110103 |
11 | 3359048123320 |
12 | 1203a9091929b |
13 | 5a7a7138460a |
14 | 28061c58ba75 |
15 | 13118c594188 |
hex | 97a9cc97b57 |
10422221110103 has 4 divisors (see below), whose sum is σ = 11369695756488. Its totient is φ = 9474746463720.
The previous prime is 10422221110079. The next prime is 10422221110123. The reversal of 10422221110103 is 30101112222401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10422221110103 - 228 = 10421952674647 is a prime.
It is a super-4 number, since 4×104222211101034 (a number of 53 digits) contains 4444 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 (10422221110123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 473737323176 + ... + 473737323197.
It is an arithmetic number, because the mean of its divisors is an integer number (2842423939122).
Almost surely, 210422221110103 is an apocalyptic number.
10422221110103 is a deficient number, since it is larger than the sum of its proper divisors (947474646385).
10422221110103 is an equidigital number, since it uses as much as digits as its factorization.
10422221110103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 947474646384.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 10422221110103 its reverse (30101112222401), we get a palindrome (40523333332504).
The spelling of 10422221110103 in words is "ten trillion, four hundred twenty-two billion, two hundred twenty-one million, one hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •