Base | Representation |
---|---|
bin | 101000101101101… |
… | …1100101110011011 |
3 | 10112012122121112202 |
4 | 1101123130232123 |
5 | 10244213300133 |
6 | 343321200415 |
7 | 45566040506 |
oct | 12133345633 |
9 | 3465577482 |
10 | 1366150043 |
11 | 641179825 |
12 | 32163010b |
13 | 18a05930b |
14 | cd62013d |
15 | 7ee0a2e8 |
hex | 516dcb9b |
1366150043 has 4 divisors (see below), whose sum is σ = 1366321320. Its totient is φ = 1365978768.
The previous prime is 1366150031. The next prime is 1366150057. The reversal of 1366150043 is 3400516631.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3400516631 = 5197 ⋅654323.
It is a cyclic number.
It is not a de Polignac number, because 1366150043 - 228 = 1097714587 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1366149988 and 1366150015.
It is not an unprimeable number, because it can be changed into a prime (1366150003) 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, 73058 + ... + 89831.
It is an arithmetic number, because the mean of its divisors is an integer number (341580330).
Almost surely, 21366150043 is an apocalyptic number.
1366150043 is a deficient number, since it is larger than the sum of its proper divisors (171277).
1366150043 is an equidigital number, since it uses as much as digits as its factorization.
1366150043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171276.
The product of its (nonzero) digits is 6480, while the sum is 29.
The square root of 1366150043 is about 36961.4670028125. The cubic root of 1366150043 is about 1109.5991959853.
Adding to 1366150043 its reverse (3400516631), we get a palindrome (4766666674).
The spelling of 1366150043 in words is "one billion, three hundred sixty-six million, one hundred fifty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •