Base | Representation |
---|---|
bin | 1011101110000100000… |
… | …0000111100000101101 |
3 | 201020200222010110211021 |
4 | 2323201000013200231 |
5 | 11244322402244411 |
6 | 232255035454141 |
7 | 20355322443013 |
oct | 2734100074055 |
9 | 636628113737 |
10 | 201343399981 |
11 | 78431111519 |
12 | 330315b7351 |
13 | 15ca97413c9 |
14 | 9a6069c8b3 |
15 | 5386388a71 |
hex | 2ee100782d |
201343399981 has 4 divisors (see below), whose sum is σ = 206785113532. Its totient is φ = 195901686432.
The previous prime is 201343399967. The next prime is 201343400017. The reversal of 201343399981 is 189993343102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 80594099881 + 120749300100 = 283891^2 + 347490^2 .
It is a cyclic number.
It is not a de Polignac number, because 201343399981 - 25 = 201343399949 is a prime.
It is a super-2 number, since 2×2013433999812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201343396981) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2720856720 + ... + 2720856793.
It is an arithmetic number, because the mean of its divisors is an integer number (51696278383).
Almost surely, 2201343399981 is an apocalyptic number.
It is an amenable number.
201343399981 is a deficient number, since it is larger than the sum of its proper divisors (5441713551).
201343399981 is an equidigital number, since it uses as much as digits as its factorization.
201343399981 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5441713550.
The product of its (nonzero) digits is 1259712, while the sum is 52.
The spelling of 201343399981 in words is "two hundred one billion, three hundred forty-three million, three hundred ninety-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •