Base | Representation |
---|---|
bin | 100000001000010111000011… |
… | …100100000011001111010011 |
3 | 200112100021222020201211101011 |
4 | 200020113003210003033103 |
5 | 122010223434000411032 |
6 | 1220313500412351351 |
7 | 41523312044301046 |
oct | 4010270344031723 |
9 | 615307866654334 |
10 | 141312000013267 |
11 | 410320a0013a76 |
12 | 13a23266a75557 |
13 | 60b08839756b5 |
14 | 26c7774498c5d |
15 | 1150cb1b86247 |
hex | 8085c39033d3 |
141312000013267 has 2 divisors, whose sum is σ = 141312000013268. Its totient is φ = 141312000013266.
The previous prime is 141312000013213. The next prime is 141312000013351. The reversal of 141312000013267 is 762310000213141.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 141312000013267 - 227 = 141311865795539 is a prime.
It is not a weakly prime, because it can be changed into another prime (141312000023267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70656000006633 + 70656000006634.
It is an arithmetic number, because the mean of its divisors is an integer number (70656000006634).
Almost surely, 2141312000013267 is an apocalyptic number.
141312000013267 is a deficient number, since it is larger than the sum of its proper divisors (1).
141312000013267 is an equidigital number, since it uses as much as digits as its factorization.
141312000013267 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 31.
The spelling of 141312000013267 in words is "one hundred forty-one trillion, three hundred twelve billion, thirteen thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •