Base | Representation |
---|---|
bin | 1011101110000011001… |
… | …1111010010111100111 |
3 | 201020200202002220212010 |
4 | 2323200303322113213 |
5 | 11244321042403143 |
6 | 232254443125303 |
7 | 20355253315605 |
oct | 2734063722747 |
9 | 636622086763 |
10 | 201340200423 |
11 | 7842a32665a |
12 | 33030513833 |
13 | 15ca8b90c8b |
14 | 9a600a8875 |
15 | 5385e55a33 |
hex | 2ee0cfa5e7 |
201340200423 has 8 divisors (see below), whose sum is σ = 268731219328. Its totient is φ = 134087990904.
The previous prime is 201340200409. The next prime is 201340200493. The reversal of 201340200423 is 324002043102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201340200423 - 26 = 201340200359 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 201340200423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201340200493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34698961 + ... + 34704762.
It is an arithmetic number, because the mean of its divisors is an integer number (33591402416).
Almost surely, 2201340200423 is an apocalyptic number.
201340200423 is a deficient number, since it is larger than the sum of its proper divisors (67391018905).
201340200423 is an equidigital number, since it uses as much as digits as its factorization.
201340200423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69404693.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 201340200423 its reverse (324002043102), we get a palindrome (525342243525).
The spelling of 201340200423 in words is "two hundred one billion, three hundred forty million, two hundred thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •