Base | Representation |
---|---|
bin | 100010101110111… |
… | …1111100011100001 |
3 | 10000020002001021011 |
4 | 1011131333203201 |
5 | 4341331143101 |
6 | 311352300521 |
7 | 40611335125 |
oct | 10535774341 |
9 | 3006061234 |
10 | 1165490401 |
11 | 548986209 |
12 | 2863a1741 |
13 | 1576009ba |
14 | b0b09585 |
15 | 6c4c0751 |
hex | 4577f8e1 |
1165490401 has 4 divisors (see below), whose sum is σ = 1166602500. Its totient is φ = 1164378304.
The previous prime is 1165490387. The next prime is 1165490441. The reversal of 1165490401 is 1040945611.
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 664402176 + 501088225 = 25776^2 + 22385^2 .
It is a cyclic number.
It is not a de Polignac number, because 1165490401 - 29 = 1165489889 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1165490441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 554476 + ... + 556573.
It is an arithmetic number, because the mean of its divisors is an integer number (291650625).
Almost surely, 21165490401 is an apocalyptic number.
It is an amenable number.
1165490401 is a deficient number, since it is larger than the sum of its proper divisors (1112099).
1165490401 is a wasteful number, since it uses less digits than its factorization.
1165490401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1112098.
The product of its (nonzero) digits is 4320, while the sum is 31.
The square root of 1165490401 is about 34139.2794446514. The cubic root of 1165490401 is about 1052.3726845960.
The spelling of 1165490401 in words is "one billion, one hundred sixty-five million, four hundred ninety thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •