Base | Representation |
---|---|
bin | 11101110000000010011… |
… | …11010101010010001011 |
3 | 10121201112110221110021201 |
4 | 32320001033111102023 |
5 | 113222003042404003 |
6 | 2101334110445031 |
7 | 133565432150263 |
oct | 16700117252213 |
9 | 3551473843251 |
10 | 1022223013003 |
11 | 364582272545 |
12 | 146144503777 |
13 | 7551a3a178a |
14 | 37693a7a7a3 |
15 | 1b8cc747b1d |
hex | ee013d548b |
1022223013003 has 4 divisors (see below), whose sum is σ = 1022272504848. Its totient is φ = 1022173521160.
The previous prime is 1022223012997. The next prime is 1022223013027. The reversal of 1022223013003 is 3003103222201.
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 1022223013003 - 221 = 1022220915851 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1022223013043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24714928 + ... + 24756253.
It is an arithmetic number, because the mean of its divisors is an integer number (255568126212).
Almost surely, 21022223013003 is an apocalyptic number.
1022223013003 is a deficient number, since it is larger than the sum of its proper divisors (49491845).
1022223013003 is an equidigital number, since it uses as much as digits as its factorization.
1022223013003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49491844.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 1022223013003 its reverse (3003103222201), we get a palindrome (4025326235204).
It can be divided in two parts, 102222 and 3013003, that added together give a square (3115225 = 17652).
The spelling of 1022223013003 in words is "one trillion, twenty-two billion, two hundred twenty-three million, thirteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •