Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …10000111011110001001 |
3 | 10112121011201211202112111 |
4 | 32203110222013132021 |
5 | 112341000024114423 |
6 | 2043221015142321 |
7 | 132150636435343 |
oct | 16432452073611 |
9 | 3477151752474 |
10 | 1000000223113 |
11 | 356109068591 |
12 | 1419820749a1 |
13 | 733b8346268 |
14 | 365864a4293 |
15 | 1b02b7ac60d |
hex | e8d4a87789 |
1000000223113 has 2 divisors, whose sum is σ = 1000000223114. Its totient is φ = 1000000223112.
The previous prime is 1000000223093. The next prime is 1000000223207. The reversal of 1000000223113 is 3113220000001.
1000000223113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 995301531904 + 4698691209 = 997648^2 + 68547^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000000223113 - 229 = 999463352201 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000000223093 and 1000000223102.
It is not a weakly prime, because it can be changed into another prime (1000000223513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500000111556 + 500000111557.
It is an arithmetic number, because the mean of its divisors is an integer number (500000111557).
Almost surely, 21000000223113 is an apocalyptic number.
It is an amenable number.
1000000223113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000000223113 is an equidigital number, since it uses as much as digits as its factorization.
1000000223113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 1000000223113 its reverse (3113220000001), we get a palindrome (4113220223114).
The spelling of 1000000223113 in words is "one trillion, two hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •