Base | Representation |
---|---|
bin | 100000000010001010111… |
… | …011111110010011101101 |
3 | 21210110002011100200222211 |
4 | 200002022323332103231 |
5 | 242031333140424234 |
6 | 4403142125010421 |
7 | 315020416150315 |
oct | 40021273762355 |
9 | 7713064320884 |
10 | 2201354233069 |
11 | 779653091372 |
12 | 2b67790b3a11 |
13 | 12c7822c9594 |
14 | 7879076c445 |
15 | 3c3e02a6164 |
hex | 2008aefe4ed |
2201354233069 has 2 divisors, whose sum is σ = 2201354233070. Its totient is φ = 2201354233068.
The previous prime is 2201354233051. The next prime is 2201354233151. The reversal of 2201354233069 is 9603324531022.
2201354233069 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., 2010760868169 + 190593364900 = 1418013^2 + 436570^2 .
It is a cyclic number.
It is not a de Polignac number, because 2201354233069 - 29 = 2201354232557 is a prime.
It is a super-2 number, since 2×22013542330692 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2201354233009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100677116534 + 1100677116535.
It is an arithmetic number, because the mean of its divisors is an integer number (1100677116535).
Almost surely, 22201354233069 is an apocalyptic number.
It is an amenable number.
2201354233069 is a deficient number, since it is larger than the sum of its proper divisors (1).
2201354233069 is an equidigital number, since it uses as much as digits as its factorization.
2201354233069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 233280, while the sum is 40.
The spelling of 2201354233069 in words is "two trillion, two hundred one billion, three hundred fifty-four million, two hundred thirty-three thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •