Base | Representation |
---|---|
bin | 1100011001110111110… |
… | …0101000000001111111 |
3 | 202101001112110221210011 |
4 | 3012131330220001333 |
5 | 11442413422004043 |
6 | 241522011324051 |
7 | 21252620162536 |
oct | 3063574500177 |
9 | 671045427704 |
10 | 213103313023 |
11 | 824162a0217 |
12 | 35373a50627 |
13 | 17131c24633 |
14 | a45846131d |
15 | 58239d259d |
hex | 319df2807f |
213103313023 has 8 divisors (see below), whose sum is σ = 216350126496. Its totient is φ = 209863315200.
The previous prime is 213103313009. The next prime is 213103313047. The reversal of 213103313023 is 320313301312.
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 213103313023 - 25 = 213103312991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 213103312985 and 213103313003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213103313623) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1640886 + ... + 1765987.
It is an arithmetic number, because the mean of its divisors is an integer number (27043765812).
Almost surely, 2213103313023 is an apocalyptic number.
213103313023 is a deficient number, since it is larger than the sum of its proper divisors (3246813473).
213103313023 is an equidigital number, since it uses as much as digits as its factorization.
213103313023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3407825.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 213103313023 its reverse (320313301312), we get a palindrome (533416614335).
It can be divided in two parts, 21310 and 3313023, that added together give a palindrome (3334333).
The spelling of 213103313023 in words is "two hundred thirteen billion, one hundred three million, three hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •