Base | Representation |
---|---|
bin | 1011101100110011001… |
… | …0001110001100110011 |
3 | 201012211022212222211002 |
4 | 2323030302032030303 |
5 | 11243124034304133 |
6 | 232201241512215 |
7 | 20344033422554 |
oct | 2731462161463 |
9 | 635738788732 |
10 | 201004213043 |
11 | 78277702337 |
12 | 32b57aa266b |
13 | 15c543a2b8a |
14 | 9a2b60832b |
15 | 53666d8ce8 |
hex | 2eccc8e333 |
201004213043 has 4 divisors (see below), whose sum is σ = 201283774560. Its totient is φ = 200724651528.
The previous prime is 201004213037. The next prime is 201004213087. The reversal of 201004213043 is 340312400102.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 340312400102 = 2 ⋅170156200051.
It is a cyclic number.
It is not a de Polignac number, because 201004213043 - 230 = 199930471219 is a prime.
It is a super-3 number, since 3×2010042130433 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201004213093) 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, 139779680 + ... + 139781117.
It is an arithmetic number, because the mean of its divisors is an integer number (50320943640).
Almost surely, 2201004213043 is an apocalyptic number.
201004213043 is a deficient number, since it is larger than the sum of its proper divisors (279561517).
201004213043 is an equidigital number, since it uses as much as digits as its factorization.
201004213043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 279561516.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 201004213043 its reverse (340312400102), we get a palindrome (541316613145).
The spelling of 201004213043 in words is "two hundred one billion, four million, two hundred thirteen thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •