Base | Representation |
---|---|
bin | 101101011110101011010101… |
… | …000001111100000110000111 |
3 | 222020012202002201102201011120 |
4 | 231132223111001330012013 |
5 | 202204112332430430043 |
6 | 1545224002315405023 |
7 | 60062661021246003 |
oct | 5536532501740607 |
9 | 866182081381146 |
10 | 200020201030023 |
11 | 588070aaa69190 |
12 | 1a525308753773 |
13 | 877ba934c189a |
14 | 375705a8b9703 |
15 | 181ceb77b9983 |
hex | b5ead507c187 |
200020201030023 has 8 divisors (see below), whose sum is σ = 290938474225536. Its totient is φ = 121224364260600.
The previous prime is 200020201029941. The next prime is 200020201030031. The reversal of 200020201030023 is 320030102020002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200020201030023 - 228 = 200019932594567 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200020201029984 and 200020201030011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200020201030033) 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, 3030609106483 + ... + 3030609106548.
It is an arithmetic number, because the mean of its divisors is an integer number (36367309278192).
Almost surely, 2200020201030023 is an apocalyptic number.
200020201030023 is a deficient number, since it is larger than the sum of its proper divisors (90918273195513).
200020201030023 is a wasteful number, since it uses less digits than its factorization.
200020201030023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6061218213045.
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 200020201030023 its reverse (320030102020002), we get a palindrome (520050303050025).
The spelling of 200020201030023 in words is "two hundred trillion, twenty billion, two hundred one million, thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.220 sec. • engine limits •