Base | Representation |
---|---|
bin | 100001011110101… |
… | …1100010111000001 |
3 | 2220021212210110222 |
4 | 1002331130113001 |
5 | 4300042400301 |
6 | 303250232425 |
7 | 36560524664 |
oct | 10275342701 |
9 | 2807783428 |
10 | 1123403201 |
11 | 52714a4a8 |
12 | 274285715 |
13 | 14b98612b |
14 | a92b16db |
15 | 6895a31b |
hex | 42f5c5c1 |
1123403201 has 2 divisors, whose sum is σ = 1123403202. Its totient is φ = 1123403200.
The previous prime is 1123403167. The next prime is 1123403227. The reversal of 1123403201 is 1023043211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 805708225 + 317694976 = 28385^2 + 17824^2 .
It is an emirp because it is prime and its reverse (1023043211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1123403201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1123403201.
It is not a weakly prime, because it can be changed into another prime (1123402201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561701600 + 561701601.
It is an arithmetic number, because the mean of its divisors is an integer number (561701601).
Almost surely, 21123403201 is an apocalyptic number.
It is an amenable number.
1123403201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123403201 is an equidigital number, since it uses as much as digits as its factorization.
1123403201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 1123403201 is about 33517.2075358315. The cubic root of 1123403201 is about 1039.5496080468.
Adding to 1123403201 its reverse (1023043211), we get a palindrome (2146446412).
The spelling of 1123403201 in words is "one billion, one hundred twenty-three million, four hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •