Base | Representation |
---|---|
bin | 10000011111000110000… |
… | …100000010110110011101 |
3 | 11000022012200222210200021 |
4 | 100133012010002312131 |
5 | 122030134213112434 |
6 | 2224240300432141 |
7 | 144564205366432 |
oct | 20370604026635 |
9 | 4008180883607 |
10 | 1132899347869 |
11 | 3a7507168a93 |
12 | 163691848651 |
13 | 82aa7a43313 |
14 | 3cb929d7b89 |
15 | 1e708ddacb4 |
hex | 107c6102d9d |
1132899347869 has 2 divisors, whose sum is σ = 1132899347870. Its totient is φ = 1132899347868.
The previous prime is 1132899347863. The next prime is 1132899347903. The reversal of 1132899347869 is 9687439982311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 965037063769 + 167862284100 = 982363^2 + 409710^2 .
It is a cyclic number.
It is not a de Polignac number, because 1132899347869 - 23 = 1132899347861 is a prime.
It is a super-2 number, since 2×11328993478692 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1132899347798 and 1132899347807.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1132899347861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566449673934 + 566449673935.
It is an arithmetic number, because the mean of its divisors is an integer number (566449673935).
Almost surely, 21132899347869 is an apocalyptic number.
It is an amenable number.
1132899347869 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132899347869 is an equidigital number, since it uses as much as digits as its factorization.
1132899347869 is an evil number, because the sum of its binary digits is even.
The product of its digits is 141087744, while the sum is 70.
The spelling of 1132899347869 in words is "one trillion, one hundred thirty-two billion, eight hundred ninety-nine million, three hundred forty-seven thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •