Base | Representation |
---|---|
bin | 100001011110001… |
… | …0010101011111001 |
3 | 2220021022110112101 |
4 | 1002330102223321 |
5 | 4300003221213 |
6 | 303235543401 |
7 | 36555130126 |
oct | 10274225371 |
9 | 2807273471 |
10 | 1123101433 |
11 | 526a63803 |
12 | 27415ab61 |
13 | 14b8ab97c |
14 | a923374d |
15 | 688eabdd |
hex | 42f12af9 |
1123101433 has 2 divisors, whose sum is σ = 1123101434. Its totient is φ = 1123101432.
The previous prime is 1123101407. The next prime is 1123101437. The reversal of 1123101433 is 3341013211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 851939344 + 271162089 = 29188^2 + 16467^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1123101433 is a prime.
It is a super-2 number, since 2×11231014332 = 2522713657613306978, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1123101433.
It is not a weakly prime, because it can be changed into another prime (1123101437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561550716 + 561550717.
It is an arithmetic number, because the mean of its divisors is an integer number (561550717).
Almost surely, 21123101433 is an apocalyptic number.
It is an amenable number.
1123101433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123101433 is an equidigital number, since it uses as much as digits as its factorization.
1123101433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 1123101433 is about 33512.7055458075. The cubic root of 1123101433 is about 1039.4565186143.
Adding to 1123101433 its reverse (3341013211), we get a palindrome (4464114644).
The spelling of 1123101433 in words is "one billion, one hundred twenty-three million, one hundred one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •