Base | Representation |
---|---|
bin | 1001010010111010000011… |
… | …1001001011011000111011 |
3 | 1100012001201002122201021122 |
4 | 2110232200321023120323 |
5 | 2314422413143244403 |
6 | 33423111002455455 |
7 | 2103254461126646 |
oct | 224564071133073 |
9 | 40161632581248 |
10 | 10220426540603 |
11 | 3290505377534 |
12 | 119095420458b |
13 | 591a223270c6 |
14 | 274958008a5d |
15 | 12accb7da838 |
hex | 94ba0e4b63b |
10220426540603 has 4 divisors (see below), whose sum is σ = 10221016617768. Its totient is φ = 10219836463440.
The previous prime is 10220426540573. The next prime is 10220426540627. The reversal of 10220426540603 is 30604562402201.
10220426540603 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10220426540603 - 26 = 10220426540539 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10220426570603) 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, 295012601 + ... + 295047242.
It is an arithmetic number, because the mean of its divisors is an integer number (2555254154442).
Almost surely, 210220426540603 is an apocalyptic number.
10220426540603 is a deficient number, since it is larger than the sum of its proper divisors (590077165).
10220426540603 is an equidigital number, since it uses as much as digits as its factorization.
10220426540603 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 590077164.
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 10220426540603 its reverse (30604562402201), we get a palindrome (40824988942804).
The spelling of 10220426540603 in words is "ten trillion, two hundred twenty billion, four hundred twenty-six million, five hundred forty thousand, six hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •