Base | Representation |
---|---|
bin | 11000000000100… |
… | …10000010100001 |
3 | 112000222012112002 |
4 | 30000102002201 |
5 | 403024303411 |
6 | 31552413345 |
7 | 4663606262 |
oct | 1400220241 |
9 | 460865462 |
10 | 201400481 |
11 | a375a187 |
12 | 57547255 |
13 | 329578a9 |
14 | 1ca68969 |
15 | 12a3433b |
hex | c0120a1 |
201400481 has 2 divisors, whose sum is σ = 201400482. Its totient is φ = 201400480.
The previous prime is 201400393. The next prime is 201400483. The reversal of 201400481 is 184004102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113209600 + 88190881 = 10640^2 + 9391^2 .
It is a cyclic number.
It is not a de Polignac number, because 201400481 - 226 = 134291617 is a prime.
It is a super-2 number, since 2×2014004812 = 81124307494062722, which contains 22 as substring.
Together with 201400483, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (201400483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100700240 + 100700241.
It is an arithmetic number, because the mean of its divisors is an integer number (100700241).
Almost surely, 2201400481 is an apocalyptic number.
It is an amenable number.
201400481 is a deficient number, since it is larger than the sum of its proper divisors (1).
201400481 is an equidigital number, since it uses as much as digits as its factorization.
201400481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 20.
The square root of 201400481 is about 14191.5637263834. The cubic root of 201400481 is about 586.1653842898.
Adding to 201400481 its reverse (184004102), we get a palindrome (385404583).
The spelling of 201400481 in words is "two hundred one million, four hundred thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •