Base | Representation |
---|---|
bin | 10000101110111110101… |
… | …111100001110001100101 |
3 | 11001221020102211201220102 |
4 | 100232332233201301211 |
5 | 122320102314220211 |
6 | 2240141020313445 |
7 | 146036664051203 |
oct | 20567657416145 |
9 | 4057212751812 |
10 | 1149956398181 |
11 | 40376a453388 |
12 | 166a520a2885 |
13 | 845957bcbb6 |
14 | 3d9300c8073 |
15 | 1eda65d1a3b |
hex | 10bbebe1c65 |
1149956398181 has 2 divisors, whose sum is σ = 1149956398182. Its totient is φ = 1149956398180.
The previous prime is 1149956398169. The next prime is 1149956398211. The reversal of 1149956398181 is 1818936599411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1127771785156 + 22184613025 = 1061966^2 + 148945^2 .
It is a cyclic number.
It is not a de Polignac number, because 1149956398181 - 214 = 1149956381797 is a prime.
It is a super-2 number, since 2×11499563981812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1149956398081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 574978199090 + 574978199091.
It is an arithmetic number, because the mean of its divisors is an integer number (574978199091).
Almost surely, 21149956398181 is an apocalyptic number.
It is an amenable number.
1149956398181 is a deficient number, since it is larger than the sum of its proper divisors (1).
1149956398181 is an equidigital number, since it uses as much as digits as its factorization.
1149956398181 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 16796160, while the sum is 65.
The spelling of 1149956398181 in words is "one trillion, one hundred forty-nine billion, nine hundred fifty-six million, three hundred ninety-eight thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •