Base | Representation |
---|---|
bin | 101110001101011001110100… |
… | …010000100100000001001111 |
3 | 222122120201021122222021012020 |
4 | 232031121310100210001033 |
5 | 203114220011012323043 |
6 | 2000123044054141223 |
7 | 60543653625613011 |
oct | 5615316420440117 |
9 | 878521248867166 |
10 | 203231213011023 |
11 | 598349675773aa |
12 | 1a9636a2051813 |
13 | 895280c8a1732 |
14 | 382862c1a21b1 |
15 | 187679c0dbe83 |
hex | b8d67442404f |
203231213011023 has 8 divisors (see below), whose sum is σ = 271513668279168. Its totient is φ = 135218116541784.
The previous prime is 203231213010979. The next prime is 203231213011037. The reversal of 203231213011023 is 320110312132302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 203231213011023 - 222 = 203231208816719 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 203231213010984 and 203231213011002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203231213001023) 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, 67339697965 + ... + 67339700982.
It is an arithmetic number, because the mean of its divisors is an integer number (33939208534896).
Almost surely, 2203231213011023 is an apocalyptic number.
203231213011023 is a deficient number, since it is larger than the sum of its proper divisors (68282455268145).
203231213011023 is a wasteful number, since it uses less digits than its factorization.
203231213011023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134679399453.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 203231213011023 its reverse (320110312132302), we get a palindrome (523341525143325).
The spelling of 203231213011023 in words is "two hundred three trillion, two hundred thirty-one billion, two hundred thirteen million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •