Base | Representation |
---|---|
bin | 101101110011010000010101… |
… | …111011001010001011100101 |
3 | 222102012221020002010101101021 |
4 | 231303100111323022023211 |
5 | 202400300004001342013 |
6 | 1552225353333131141 |
7 | 60300102402255355 |
oct | 5563202573121345 |
9 | 872187202111337 |
10 | 201434334012133 |
11 | 59201904193082 |
12 | 1a7133a6a89ab1 |
13 | 885223a128561 |
14 | 37a568c0d6b65 |
15 | 1844b81579a8d |
hex | b73415eca2e5 |
201434334012133 has 8 divisors (see below), whose sum is σ = 206397769344800. Its totient is φ = 196483576676688.
The previous prime is 201434334012127. The next prime is 201434334012209. The reversal of 201434334012133 is 331210433434102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201434334012133 - 225 = 201434300457701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201434334112133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3169467138 + ... + 3169530691.
It is an arithmetic number, because the mean of its divisors is an integer number (25799721168100).
Almost surely, 2201434334012133 is an apocalyptic number.
It is an amenable number.
201434334012133 is a deficient number, since it is larger than the sum of its proper divisors (4963435332667).
201434334012133 is an equidigital number, since it uses as much as digits as its factorization.
201434334012133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6338998611.
The product of its (nonzero) digits is 62208, while the sum is 34.
Adding to 201434334012133 its reverse (331210433434102), we get a palindrome (532644767446235).
The spelling of 201434334012133 in words is "two hundred one trillion, four hundred thirty-four billion, three hundred thirty-four million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •