Base | Representation |
---|---|
bin | 1001000111010000001111… |
… | …0010001111010001111011 |
3 | 1022110220221111212121021222 |
4 | 2101310003302033101323 |
5 | 2303132403340444003 |
6 | 33151120533022255 |
7 | 2052636306261335 |
oct | 221640362172173 |
9 | 38426844777258 |
10 | 10020222203003 |
11 | 3213609230491 |
12 | 1159ba018498b |
13 | 578b9789250c |
14 | 268da4b36455 |
15 | 1259b0451c38 |
hex | 91d03c8f47b |
10020222203003 has 8 divisors (see below), whose sum is σ = 10098959846976. Its totient is φ = 9941741452800.
The previous prime is 10020222202981. The next prime is 10020222203059. The reversal of 10020222203003 is 30030222202001.
10020222203003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10020222203003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10020222203903) 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, 64145126 + ... + 64301147.
It is an arithmetic number, because the mean of its divisors is an integer number (1262369980872).
Almost surely, 210020222203003 is an apocalyptic number.
10020222203003 is a deficient number, since it is larger than the sum of its proper divisors (78737643973).
10020222203003 is a wasteful number, since it uses less digits than its factorization.
10020222203003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128446885.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 10020222203003 its reverse (30030222202001), we get a palindrome (40050444405004).
The spelling of 10020222203003 in words is "ten trillion, twenty billion, two hundred twenty-two million, two hundred three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •