Base | Representation |
---|---|
bin | 101000101110010… |
… | …1110100110111011 |
3 | 10112020021122121200 |
4 | 1101130232212323 |
5 | 10244310013220 |
6 | 343332305243 |
7 | 45601635360 |
oct | 12134564673 |
9 | 3466248550 |
10 | 1366485435 |
11 | 641388807 |
12 | 321772223 |
13 | 18a145b83 |
14 | cd6aa467 |
15 | 7ee74890 |
hex | 5172e9bb |
1366485435 has 48 divisors (see below), whose sum is σ = 2747387136. Its totient is φ = 615345984.
The previous prime is 1366485409. The next prime is 1366485451. The reversal of 1366485435 is 5345846631.
1366485435 is a `hidden beast` number, since 1 + 3 + 66 + 48 + 543 + 5 = 666.
It is not a de Polignac number, because 1366485435 - 25 = 1366485403 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11269 + ... + 53478.
It is an arithmetic number, because the mean of its divisors is an integer number (57237232).
Almost surely, 21366485435 is an apocalyptic number.
1366485435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1366485435 is an abundant number, since it is smaller than the sum of its proper divisors (1380901701).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1366485435 is a wasteful number, since it uses less digits than its factorization.
1366485435 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64832 (or 64829 counting only the distinct ones).
The product of its digits is 1036800, while the sum is 45.
The square root of 1366485435 is about 36966.0037737378. The cubic root of 1366485435 is about 1109.6899913424.
It can be divided in two parts, 13664 and 85435, that added together give a palindrome (99099).
The spelling of 1366485435 in words is "one billion, three hundred sixty-six million, four hundred eighty-five thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •