Base | Representation |
---|---|
bin | 1011101101000011001… |
… | …0100100011100010101 |
3 | 201020000000100002211212 |
4 | 2323100302210130111 |
5 | 11243243240204023 |
6 | 232212042111205 |
7 | 20345510545052 |
oct | 2732062443425 |
9 | 636000302755 |
10 | 201071413013 |
11 | 783016306a9 |
12 | 32b764ab505 |
13 | 15c652a1083 |
14 | 9a364dc029 |
15 | 536c55ee78 |
hex | 2ed0ca4715 |
201071413013 has 4 divisors (see below), whose sum is σ = 202304980128. Its totient is φ = 199837845900.
The previous prime is 201071412991. The next prime is 201071413033. The reversal of 201071413013 is 310314170102.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 201071413013 - 28 = 201071412757 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201071413013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201071413033) 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, 616783313 + ... + 616783638.
It is an arithmetic number, because the mean of its divisors is an integer number (50576245032).
Almost surely, 2201071413013 is an apocalyptic number.
It is an amenable number.
201071413013 is a deficient number, since it is larger than the sum of its proper divisors (1233567115).
201071413013 is a wasteful number, since it uses less digits than its factorization.
201071413013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1233567114.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 201071413013 its reverse (310314170102), we get a palindrome (511385583115).
The spelling of 201071413013 in words is "two hundred one billion, seventy-one million, four hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •