Base | Representation |
---|---|
bin | 1011101101101100000… |
… | …1001010110011001001 |
3 | 201020102222020020210220 |
4 | 2323123001022303021 |
5 | 11244121202343142 |
6 | 232241052100253 |
7 | 20352663244365 |
oct | 2733301126311 |
9 | 636388206726 |
10 | 201243012297 |
11 | 7838a485798 |
12 | 33003a64689 |
13 | 15c919c3302 |
14 | 9a5120a2a5 |
15 | 537c6592ec |
hex | 2edb04acc9 |
201243012297 has 8 divisors (see below), whose sum is σ = 268351388256. Its totient is φ = 134148322272.
The previous prime is 201243012277. The next prime is 201243012323. The reversal of 201243012297 is 792210342102.
201243012297 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201243012297 - 215 = 201242979529 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201243012277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3387123 + ... + 3446024.
It is an arithmetic number, because the mean of its divisors is an integer number (33543923532).
Almost surely, 2201243012297 is an apocalyptic number.
It is an amenable number.
201243012297 is a deficient number, since it is larger than the sum of its proper divisors (67108375959).
201243012297 is an equidigital number, since it uses as much as digits as its factorization.
201243012297 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6842967.
The product of its (nonzero) digits is 12096, while the sum is 33.
Adding to 201243012297 its reverse (792210342102), we get a palindrome (993453354399).
The spelling of 201243012297 in words is "two hundred one billion, two hundred forty-three million, twelve thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.381 sec. • engine limits •