Base | Representation |
---|---|
bin | 10000101010101111010… |
… | …010010101101110101011 |
3 | 11001111111001011111021122 |
4 | 100222233102111232223 |
5 | 122231240420334011 |
6 | 2234105050325455 |
7 | 145516063250432 |
oct | 20525722255653 |
9 | 4044431144248 |
10 | 1145402121131 |
11 | 401842700654 |
12 | 165ba0a2988b |
13 | 8401b0c12c8 |
14 | 3d61b2d0119 |
15 | 1ebdb8713db |
hex | 10aaf495bab |
1145402121131 has 2 divisors, whose sum is σ = 1145402121132. Its totient is φ = 1145402121130.
The previous prime is 1145402121113. The next prime is 1145402121163. The reversal of 1145402121131 is 1311212045411.
Together with previous prime (1145402121113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1145402121131 - 214 = 1145402104747 is a prime.
It is a super-2 number, since 2×11454021211312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1145402121131.
It is not a weakly prime, because it can be changed into another prime (1145402120131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572701060565 + 572701060566.
It is an arithmetic number, because the mean of its divisors is an integer number (572701060566).
Almost surely, 21145402121131 is an apocalyptic number.
1145402121131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1145402121131 is an equidigital number, since it uses as much as digits as its factorization.
1145402121131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 960, while the sum is 26.
Adding to 1145402121131 its reverse (1311212045411), we get a palindrome (2456614166542).
The spelling of 1145402121131 in words is "one trillion, one hundred forty-five billion, four hundred two million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •