Base | Representation |
---|---|
bin | 101101100001101110110100… |
… | …000101001010100010111111 |
3 | 222020221210220001102201202200 |
4 | 231201232310011022202333 |
5 | 202221032222004000043 |
6 | 1545504234441522543 |
7 | 60114101402001321 |
oct | 5541566405124277 |
9 | 866853801381680 |
10 | 200230101625023 |
11 | 588881224199a8 |
12 | 1a559b27aa3453 |
13 | 8795804a354a2 |
14 | 376328d845611 |
15 | 18236a00137d3 |
hex | b61bb414a8bf |
200230101625023 has 24 divisors (see below), whose sum is σ = 304637714035200. Its totient is φ = 126380413955664.
The previous prime is 200230101624919. The next prime is 200230101625033. The reversal of 200230101625023 is 320526101032002.
It is a happy number.
200230101625023 is a `hidden beast` number, since 2 + 0 + 0 + 2 + 3 + 0 + 10 + 1 + 625 + 0 + 23 = 666.
It is a de Polignac number, because none of the positive numbers 2k-200230101625023 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200230101625033) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 373355613 + ... + 373891526.
It is an arithmetic number, because the mean of its divisors is an integer number (12693238084800).
Almost surely, 2200230101625023 is an apocalyptic number.
200230101625023 is a deficient number, since it is larger than the sum of its proper divisors (104407612410177).
200230101625023 is a wasteful number, since it uses less digits than its factorization.
200230101625023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 747248731 (or 747248728 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 200230101625023 its reverse (320526101032002), we get a palindrome (520756202657025).
The spelling of 200230101625023 in words is "two hundred trillion, two hundred thirty billion, one hundred one million, six hundred twenty-five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •