Base | Representation |
---|---|
bin | 1101000110001111001… |
… | …0011101101001101111 |
3 | 210111210111122221021020 |
4 | 3101203302131221233 |
5 | 12141311143104211 |
6 | 251211434105223 |
7 | 22154006313105 |
oct | 3214362355157 |
9 | 714714587236 |
10 | 225012472431 |
11 | 87477746a1a |
12 | 3773827b213 |
13 | 182ac301716 |
14 | ac67d93c75 |
15 | 5cbe2ac306 |
hex | 3463c9da6f |
225012472431 has 4 divisors (see below), whose sum is σ = 300016629912. Its totient is φ = 150008314952.
The previous prime is 225012472429. The next prime is 225012472439. The reversal of 225012472431 is 134274210522.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 225012472431 - 21 = 225012472429 is a prime.
It is a super-2 number, since 2×2250124724312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 225012472392 and 225012472401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (225012472439) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 37502078736 + ... + 37502078741.
It is an arithmetic number, because the mean of its divisors is an integer number (75004157478).
Almost surely, 2225012472431 is an apocalyptic number.
225012472431 is a deficient number, since it is larger than the sum of its proper divisors (75004157481).
225012472431 is an equidigital number, since it uses as much as digits as its factorization.
225012472431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75004157480.
The product of its (nonzero) digits is 26880, while the sum is 33.
Adding to 225012472431 its reverse (134274210522), we get a palindrome (359286682953).
The spelling of 225012472431 in words is "two hundred twenty-five billion, twelve million, four hundred seventy-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •