Base | Representation |
---|---|
bin | 101101011110101101000000… |
… | …111111000010101101100111 |
3 | 222020012220202221111012001022 |
4 | 231132231000333002231213 |
5 | 202204130040111210043 |
6 | 1545224502135321355 |
7 | 60063053633106113 |
oct | 5536550077025547 |
9 | 866186687435038 |
10 | 200022012210023 |
11 | 5880794a369563 |
12 | 1a52573322025b |
13 | 877bcc17c7623 |
14 | 375718d262743 |
15 | 181d0717d0868 |
hex | b5eb40fc2b67 |
200022012210023 has 4 divisors (see below), whose sum is σ = 200022054028440. Its totient is φ = 200021970391608.
The previous prime is 200022012209993. The next prime is 200022012210107. The reversal of 200022012210023 is 320012210220002.
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 200022012210023 - 226 = 200021945101159 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200022012209983 and 200022012210010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200022012210623) 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, 12646028 + ... + 23663601.
It is an arithmetic number, because the mean of its divisors is an integer number (50005513507110).
Almost surely, 2200022012210023 is an apocalyptic number.
200022012210023 is a deficient number, since it is larger than the sum of its proper divisors (41818417).
200022012210023 is an equidigital number, since it uses as much as digits as its factorization.
200022012210023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41818416.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 200022012210023 its reverse (320012210220002), we get a palindrome (520034222430025).
The spelling of 200022012210023 in words is "two hundred trillion, twenty-two billion, twelve million, two hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •