Base | Representation |
---|---|
bin | 101001110000101… |
… | …0011111101011001 |
3 | 10121122200102212212 |
4 | 1103201103331121 |
5 | 10332204211213 |
6 | 351013244505 |
7 | 46503232664 |
oct | 12341237531 |
9 | 3548612785 |
10 | 1401241433 |
11 | 659a67479 |
12 | 331333735 |
13 | 1943c4857 |
14 | d41566db |
15 | 8303c9a8 |
hex | 53853f59 |
1401241433 has 2 divisors, whose sum is σ = 1401241434. Its totient is φ = 1401241432.
The previous prime is 1401241427. The next prime is 1401241451. The reversal of 1401241433 is 3341421041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 763527424 + 637714009 = 27632^2 + 25253^2 .
It is a cyclic number.
It is not a de Polignac number, because 1401241433 - 224 = 1384464217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1401241399 and 1401241408.
It is not a weakly prime, because it can be changed into another prime (1401241403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 700620716 + 700620717.
It is an arithmetic number, because the mean of its divisors is an integer number (700620717).
Almost surely, 21401241433 is an apocalyptic number.
It is an amenable number.
1401241433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1401241433 is an equidigital number, since it uses as much as digits as its factorization.
1401241433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 1401241433 is about 37433.1595380353. The cubic root of 1401241433 is about 1119.0195056713.
Adding to 1401241433 its reverse (3341421041), we get a palindrome (4742662474).
The spelling of 1401241433 in words is "one billion, four hundred one million, two hundred forty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.590 sec. • engine limits •