Base | Representation |
---|---|
bin | 10111110110000… |
… | …01100000000111 |
3 | 111221101011122002 |
4 | 23323001200013 |
5 | 402201201043 |
6 | 31503055515 |
7 | 4646105405 |
oct | 1373014007 |
9 | 457334562 |
10 | 200022023 |
11 | a29a8563 |
12 | 56ba159b |
13 | 32594336 |
14 | 1c7ca475 |
15 | 12860bb8 |
hex | bec1807 |
200022023 has 4 divisors (see below), whose sum is σ = 200194008. Its totient is φ = 199850040.
The previous prime is 200021953. The next prime is 200022029. The reversal of 200022023 is 320220002.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320220002 = 2 ⋅160110001.
It is a cyclic number.
It is not a de Polignac number, because 200022023 - 214 = 200005639 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200021995 and 200022013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200022029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 84236 + ... + 86577.
It is an arithmetic number, because the mean of its divisors is an integer number (50048502).
Almost surely, 2200022023 is an apocalyptic number.
200022023 is a deficient number, since it is larger than the sum of its proper divisors (171985).
200022023 is a wasteful number, since it uses less digits than its factorization.
200022023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171984.
The product of its (nonzero) digits is 48, while the sum is 11.
The square root of 200022023 is about 14142.9142329295. The cubic root of 200022023 is about 584.8250120690.
Adding to 200022023 its reverse (320220002), we get a palindrome (520242025).
The spelling of 200022023 in words is "two hundred million, twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •