Base | Representation |
---|---|
bin | 1110010001111000001… |
… | …0010010001110000010 |
3 | 212110012120022102010120 |
4 | 3210132002102032002 |
5 | 13004402131120031 |
6 | 304410323441110 |
7 | 23503120350000 |
oct | 3443602221602 |
9 | 773176272116 |
10 | 245317051266 |
11 | 95047097591 |
12 | 3b664226196 |
13 | 1a196b1b301 |
14 | bc328c1a70 |
15 | 65abb3da96 |
hex | 391e092382 |
245317051266 has 80 divisors (see below), whose sum is σ = 572784512064. Its totient is φ = 70040128032.
The previous prime is 245317051253. The next prime is 245317051279. The reversal of 245317051266 is 662150713542.
245317051266 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (245317051253) and next prime (245317051279).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 23001051 + ... + 23011713.
Almost surely, 2245317051266 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 245317051266, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (286392256032).
245317051266 is an abundant number, since it is smaller than the sum of its proper divisors (327467460798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
245317051266 is a wasteful number, since it uses less digits than its factorization.
245317051266 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12293 (or 12272 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 42.
The spelling of 245317051266 in words is "two hundred forty-five billion, three hundred seventeen million, fifty-one thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •