Base | Representation |
---|---|
bin | 1101011001010000111… |
… | …0111001101001000101 |
3 | 210222222110202102100000 |
4 | 3112110032321221011 |
5 | 12232241232411043 |
6 | 253414334311513 |
7 | 22424410301301 |
oct | 3262416715105 |
9 | 728873672300 |
10 | 230120200773 |
11 | 89658943911 |
12 | 38722958599 |
13 | 1891457b698 |
14 | b1d0498d01 |
15 | 5ebc8e32d3 |
hex | 35943b9a45 |
230120200773 has 96 divisors (see below), whose sum is σ = 369008640000. Its totient is φ = 142990142400.
The previous prime is 230120200771. The next prime is 230120200781. The reversal of 230120200773 is 377002021032.
It is a happy number.
230120200773 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 230120200773 - 21 = 230120200771 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230120200771) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 109008988 + ... + 109011098.
It is an arithmetic number, because the mean of its divisors is an integer number (3843840000).
Almost surely, 2230120200773 is an apocalyptic number.
It is an amenable number.
230120200773 is a deficient number, since it is larger than the sum of its proper divisors (138888439227).
230120200773 is a wasteful number, since it uses less digits than its factorization.
230120200773 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2685 (or 2673 counting only the distinct ones).
The product of its (nonzero) digits is 3528, while the sum is 27.
The spelling of 230120200773 in words is "two hundred thirty billion, one hundred twenty million, two hundred thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •