Base | Representation |
---|---|
bin | 11101001110011… |
… | …10110101011001 |
3 | 122002022200201001 |
4 | 32213032311121 |
5 | 1000230243101 |
6 | 40154425001 |
7 | 6034604635 |
oct | 1647166531 |
9 | 562280631 |
10 | 245165401 |
11 | 116431438 |
12 | 6a132161 |
13 | 3ba3bcb0 |
14 | 247bbdc5 |
15 | 167cb901 |
hex | e9ced59 |
245165401 has 4 divisors (see below), whose sum is σ = 264024292. Its totient is φ = 226306512.
The previous prime is 245165399. The next prime is 245165429. The reversal of 245165401 is 104561542.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 31304025 + 213861376 = 5595^2 + 14624^2 .
It is a cyclic number.
It is not a de Polignac number, because 245165401 - 21 = 245165399 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 245165401.
It is not an unprimeable number, because it can be changed into a prime (245165461) 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, 9429426 + ... + 9429451.
It is an arithmetic number, because the mean of its divisors is an integer number (66006073).
Almost surely, 2245165401 is an apocalyptic number.
It is an amenable number.
245165401 is a deficient number, since it is larger than the sum of its proper divisors (18858891).
245165401 is a wasteful number, since it uses less digits than its factorization.
245165401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18858890.
The product of its (nonzero) digits is 4800, while the sum is 28.
The square root of 245165401 is about 15657.7584921980. The cubic root of 245165401 is about 625.8732548333.
The spelling of 245165401 in words is "two hundred forty-five million, one hundred sixty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •