Base | Representation |
---|---|
bin | 1110010001011110101… |
… | …0101110100000111101 |
3 | 212102221010021102210000 |
4 | 3210113222232200331 |
5 | 13004142303244123 |
6 | 304351545504513 |
7 | 23500352262315 |
oct | 3442752564075 |
9 | 772833242700 |
10 | 245210212413 |
11 | 94aa1854a11 |
12 | 3b6344a2139 |
13 | 1a17a951a5a |
14 | bc22630445 |
15 | 65a2587b43 |
hex | 3917aae83d |
245210212413 has 20 divisors (see below), whose sum is σ = 366345992188. Its totient is φ = 163453697280.
The previous prime is 245210212411. The next prime is 245210212421. The reversal of 245210212413 is 314212012542.
245210212413 is a `hidden beast` number, since 2 + 4 + 521 + 0 + 2 + 124 + 13 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 167233559364 + 77976653049 = 408942^2 + 279243^2 .
It is not a de Polignac number, because 245210212413 - 21 = 245210212411 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (245210212411) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 506445 + ... + 864237.
Almost surely, 2245210212413 is an apocalyptic number.
It is an amenable number.
245210212413 is a deficient number, since it is larger than the sum of its proper divisors (121135779775).
245210212413 is an equidigital number, since it uses as much as digits as its factorization.
245210212413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366266 (or 366257 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 245210212413 its reverse (314212012542), we get a palindrome (559422224955).
The spelling of 245210212413 in words is "two hundred forty-five billion, two hundred ten million, two hundred twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •