Base | Representation |
---|---|
bin | 100001111000010… |
… | …0111110011010101 |
3 | 2221020010102001201 |
4 | 1003300213303111 |
5 | 4312011210123 |
6 | 304445552501 |
7 | 40112543212 |
oct | 10360476325 |
9 | 2836112051 |
10 | 1136819413 |
11 | 533783284 |
12 | 278875731 |
13 | 1516a2912 |
14 | aada4b09 |
15 | 69c0a5ad |
hex | 43c27cd5 |
1136819413 has 18 divisors (see below), whose sum is σ = 1225599522. Its totient is φ = 1053613440.
The previous prime is 1136819399. The next prime is 1136819447. The reversal of 1136819413 is 3149186311.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 680270724 + 456548689 = 26082^2 + 21367^2 .
It is not a de Polignac number, because 1136819413 - 29 = 1136818901 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1136819813) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 4716973 + ... + 4717213.
Almost surely, 21136819413 is an apocalyptic number.
It is an amenable number.
1136819413 is a deficient number, since it is larger than the sum of its proper divisors (88780109).
1136819413 is an frugal number, since it uses more digits than its factorization.
1136819413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 565 (or 301 counting only the distinct ones).
The product of its digits is 15552, while the sum is 37.
The square root of 1136819413 is about 33716.7527054430. The cubic root of 1136819413 is about 1043.6715070331.
Multiplying 1136819413 by its sum of digits (37), we get a square (42062318281 = 2050912).
1136819413 divided by its sum of digits (37) gives a square (30724849 = 55432).
The spelling of 1136819413 in words is "one billion, one hundred thirty-six million, eight hundred nineteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •