Base | Representation |
---|---|
bin | 1101000110010001111… |
… | …0011100100011111101 |
3 | 210111211022100201021110 |
4 | 3101210132130203331 |
5 | 12141322121033201 |
6 | 251212525152233 |
7 | 22154206313640 |
oct | 3214436344375 |
9 | 714738321243 |
10 | 225024002301 |
11 | 8748320153a |
12 | 377400bb679 |
13 | 182b180a727 |
14 | ac69715a57 |
15 | 5cc02d86d6 |
hex | 346479c8fd |
225024002301 has 16 divisors (see below), whose sum is σ = 343344325248. Its totient is φ = 128416166400.
The previous prime is 225024002261. The next prime is 225024002309. The reversal of 225024002301 is 103200420522.
It is not a de Polignac number, because 225024002301 - 221 = 225021905149 is a prime.
It is a super-2 number, since 2×2250240023012 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (225024002309) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7024380 + ... + 7056341.
It is an arithmetic number, because the mean of its divisors is an integer number (21459020328).
Almost surely, 2225024002301 is an apocalyptic number.
225024002301 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
225024002301 is a deficient number, since it is larger than the sum of its proper divisors (118320322947).
225024002301 is a wasteful number, since it uses less digits than its factorization.
225024002301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14081492.
The product of its (nonzero) digits is 960, while the sum is 21.
Adding to 225024002301 its reverse (103200420522), we get a palindrome (328224422823).
The spelling of 225024002301 in words is "two hundred twenty-five billion, twenty-four million, two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •