Base | Representation |
---|---|
bin | 1011101110000011100… |
… | …0011111110101000001 |
3 | 201020200211100222201000 |
4 | 2323200320133311001 |
5 | 11244321344334213 |
6 | 232254525002213 |
7 | 20355266453163 |
oct | 2734070376501 |
9 | 636624328630 |
10 | 201341402433 |
11 | 7842aa77756 |
12 | 330309b3369 |
13 | 15ca91c2122 |
14 | 9a602dc933 |
15 | 53860e1c73 |
hex | 2ee0e1fd41 |
201341402433 has 16 divisors (see below), whose sum is σ = 305558769600. Its totient is φ = 130953756960.
The previous prime is 201341402411. The next prime is 201341402443. The reversal of 201341402433 is 334204143102.
201341402433 is a `hidden beast` number, since 2 + 0 + 1 + 3 + 414 + 0 + 243 + 3 = 666.
It is not a de Polignac number, because 201341402433 - 214 = 201341386049 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 201341402397 and 201341402406.
It is not an unprimeable number, because it can be changed into a prime (201341402443) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 90939003 + ... + 90941216.
It is an arithmetic number, because the mean of its divisors is an integer number (19097423100).
Almost surely, 2201341402433 is an apocalyptic number.
It is an amenable number.
201341402433 is a deficient number, since it is larger than the sum of its proper divisors (104217367167).
201341402433 is a wasteful number, since it uses less digits than its factorization.
201341402433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181880269 (or 181880263 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 201341402433 its reverse (334204143102), we get a palindrome (535545545535).
The spelling of 201341402433 in words is "two hundred one billion, three hundred forty-one million, four hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •