Base | Representation |
---|---|
bin | 1101000110001111001… |
… | …0011011110101111101 |
3 | 210111210111122120002210 |
4 | 3101203302123311331 |
5 | 12141311142340041 |
6 | 251211434011033 |
7 | 22154006252361 |
oct | 3214362336575 |
9 | 714714576083 |
10 | 225012465021 |
11 | 874777413a3 |
12 | 37738276a79 |
13 | 182ac2cb236 |
14 | ac67d912a1 |
15 | 5cbe2aa016 |
hex | 3463c9bd7d |
225012465021 has 8 divisors (see below), whose sum is σ = 300261936960. Its totient is φ = 149885651552.
The previous prime is 225012464981. The next prime is 225012465053. The reversal of 225012465021 is 120564210522.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 225012465021 - 222 = 225008270717 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 225012465021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (225012465421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30660336 + ... + 30667673.
It is an arithmetic number, because the mean of its divisors is an integer number (37532742120).
Almost surely, 2225012465021 is an apocalyptic number.
It is an amenable number.
225012465021 is a deficient number, since it is larger than the sum of its proper divisors (75249471939).
225012465021 is a wasteful number, since it uses less digits than its factorization.
225012465021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61329235.
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 225012465021 its reverse (120564210522), we get a palindrome (345576675543).
The spelling of 225012465021 in words is "two hundred twenty-five billion, twelve million, four hundred sixty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •