Base | Representation |
---|---|
bin | 1101001000011110111… |
… | …0100100001001000101 |
3 | 210120100112020100211221 |
4 | 3102013232210021011 |
5 | 12144030022231323 |
6 | 251351333400341 |
7 | 22204650341365 |
oct | 3220756441105 |
9 | 716315210757 |
10 | 225615430213 |
11 | 87757035038 |
12 | 378861990b1 |
13 | 183771c4684 |
14 | acc40aa9a5 |
15 | 5d071b155d |
hex | 3487ba4245 |
225615430213 has 24 divisors (see below), whose sum is σ = 248490859680. Its totient is φ = 204261472800.
The previous prime is 225615430207. The next prime is 225615430217. The reversal of 225615430213 is 312034516522.
It is not a de Polignac number, because 225615430213 - 217 = 225615299141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (225615430217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11679663 + ... + 11698963.
It is an arithmetic number, because the mean of its divisors is an integer number (10353785820).
Almost surely, 2225615430213 is an apocalyptic number.
225615430213 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
225615430213 is a deficient number, since it is larger than the sum of its proper divisors (22875429467).
225615430213 is a wasteful number, since it uses less digits than its factorization.
225615430213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20529 (or 20506 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 225615430213 its reverse (312034516522), we get a palindrome (537649946735).
The spelling of 225615430213 in words is "two hundred twenty-five billion, six hundred fifteen million, four hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •