Base | Representation |
---|---|
bin | 11101010100100… |
… | …11100100000110 |
3 | 122010211122001200 |
4 | 32222103210012 |
5 | 1000432034311 |
6 | 40224003330 |
7 | 6044502135 |
oct | 1652234406 |
9 | 563748050 |
10 | 245971206 |
11 | 116931898 |
12 | 6a460546 |
13 | 3bc619c0 |
14 | 2494b91c |
15 | 168da556 |
hex | ea93906 |
245971206 has 48 divisors (see below), whose sum is σ = 575055936. Its totient is φ = 75535488.
The previous prime is 245971199. The next prime is 245971213. The reversal of 245971206 is 602179542.
245971206 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 (245971199) and next prime (245971213).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 222451 + ... + 223553.
It is an arithmetic number, because the mean of its divisors is an integer number (11980332).
Almost surely, 2245971206 is an apocalyptic number.
245971206 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
245971206 is an abundant number, since it is smaller than the sum of its proper divisors (329084730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
245971206 is a wasteful number, since it uses less digits than its factorization.
245971206 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2077 (or 2074 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 245971206 is about 15683.4691953024. The cubic root of 245971206 is about 626.5582077400.
The spelling of 245971206 in words is "two hundred forty-five million, nine hundred seventy-one thousand, two hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •