Base | Representation |
---|---|
bin | 1101000110011011010… |
… | …1100011001010010101 |
3 | 210111221001220011001020 |
4 | 3101212311203022111 |
5 | 12141412241104302 |
6 | 251220502151353 |
7 | 22155200101152 |
oct | 3214665431225 |
9 | 714831804036 |
10 | 225063613077 |
11 | 874a35a6716 |
12 | 37751422559 |
13 | 182b9a99064 |
14 | ac70aa7229 |
15 | 5cc3a0eebc |
hex | 3466d63295 |
225063613077 has 8 divisors (see below), whose sum is σ = 300087611616. Its totient is φ = 150041011632.
The previous prime is 225063613069. The next prime is 225063613147. The reversal of 225063613077 is 770316360522.
225063613077 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 225063613077 - 23 = 225063613069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (225063613277) 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 7 ways as a sum of consecutive naturals, for example, 114643 + ... + 680639.
It is an arithmetic number, because the mean of its divisors is an integer number (37510951452).
Almost surely, 2225063613077 is an apocalyptic number.
It is an amenable number.
225063613077 is a deficient number, since it is larger than the sum of its proper divisors (75023998539).
225063613077 is a wasteful number, since it uses less digits than its factorization.
225063613077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 698547.
The product of its (nonzero) digits is 317520, while the sum is 42.
Adding to 225063613077 its reverse (770316360522), we get a palindrome (995379973599).
The spelling of 225063613077 in words is "two hundred twenty-five billion, sixty-three million, six hundred thirteen thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •