Base | Representation |
---|---|
bin | 101101101100111100010000… |
… | …000100101010001010010111 |
3 | 222100200110021112210020122201 |
4 | 231230330100010222022113 |
5 | 202321142402200022411 |
6 | 1551254155043305331 |
7 | 60223542245235046 |
oct | 5554742004521227 |
9 | 870613245706581 |
10 | 201000444142231 |
11 | 5905489a713938 |
12 | 1a66329607b247 |
13 | 8820350583076 |
14 | 378c68b04255d |
15 | 18387397d83c1 |
hex | b6cf1012a297 |
201000444142231 has 2 divisors, whose sum is σ = 201000444142232. Its totient is φ = 201000444142230.
The previous prime is 201000444142063. The next prime is 201000444142339. The reversal of 201000444142231 is 132241444000102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201000444142231 is a prime.
It is a super-2 number, since 2×2010004441422312 (a number of 29 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 201000444142231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201000244142231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500222071115 + 100500222071116.
It is an arithmetic number, because the mean of its divisors is an integer number (100500222071116).
Almost surely, 2201000444142231 is an apocalyptic number.
201000444142231 is a deficient number, since it is larger than the sum of its proper divisors (1).
201000444142231 is an equidigital number, since it uses as much as digits as its factorization.
201000444142231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 201000444142231 its reverse (132241444000102), we get a palindrome (333241888142333).
The spelling of 201000444142231 in words is "two hundred one trillion, four hundred forty-four million, one hundred forty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •