Base | Representation |
---|---|
bin | 11101010010001… |
… | …11111011011001 |
3 | 122010020220002102 |
4 | 32221013323121 |
5 | 1000342131101 |
6 | 40213213145 |
7 | 6042041666 |
oct | 1651077331 |
9 | 563226072 |
10 | 245661401 |
11 | 116740057 |
12 | 6a3311b5 |
13 | 3bb8399b |
14 | 248aaa6d |
15 | 1687886b |
hex | ea47ed9 |
245661401 has 4 divisors (see below), whose sum is σ = 246934452. Its totient is φ = 244388352.
The previous prime is 245661397. The next prime is 245661421. The reversal of 245661401 is 104166542.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 104166542 = 2 ⋅52083271.
It can be written as a sum of positive squares in 2 ways, for example, as 32501401 + 213160000 = 5701^2 + 14600^2 .
It is a cyclic number.
It is not a de Polignac number, because 245661401 - 22 = 245661397 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (245661421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 636236 + ... + 636621.
It is an arithmetic number, because the mean of its divisors is an integer number (61733613).
Almost surely, 2245661401 is an apocalyptic number.
It is an amenable number.
245661401 is a deficient number, since it is larger than the sum of its proper divisors (1273051).
245661401 is a wasteful number, since it uses less digits than its factorization.
245661401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1273050.
The product of its (nonzero) digits is 5760, while the sum is 29.
The square root of 245661401 is about 15673.5892826117. The cubic root of 245661401 is about 626.2950435793.
The spelling of 245661401 in words is "two hundred forty-five million, six hundred sixty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •