Base | Representation |
---|---|
bin | 1100011010101100001… |
… | …1011011110111100111 |
3 | 202101121212020110210012 |
4 | 3012223003123313213 |
5 | 11443341214431043 |
6 | 241555504320435 |
7 | 21261230204411 |
oct | 3065303336747 |
9 | 671555213705 |
10 | 213323202023 |
11 | 82519428068 |
12 | 3541561311b |
13 | 17168653679 |
14 | a47973d9b1 |
15 | 5837e69a18 |
hex | 31ab0dbde7 |
213323202023 has 8 divisors (see below), whose sum is σ = 213560082192. Its totient is φ = 213086454336.
The previous prime is 213323202013. The next prime is 213323202041. The reversal of 213323202023 is 320202323312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 213323202023 - 216 = 213323136487 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 213323202023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213323202013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3381536 + ... + 3444042.
It is an arithmetic number, because the mean of its divisors is an integer number (26695010274).
Almost surely, 2213323202023 is an apocalyptic number.
213323202023 is a deficient number, since it is larger than the sum of its proper divisors (236880169).
213323202023 is a wasteful number, since it uses less digits than its factorization.
213323202023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66241.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 213323202023 its reverse (320202323312), we get a palindrome (533525525335).
The spelling of 213323202023 in words is "two hundred thirteen billion, three hundred twenty-three million, two hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •