Base | Representation |
---|---|
bin | 1111010110100111… |
… | …1001100001011001 |
3 | 101122020010212220112 |
4 | 3311221321201121 |
5 | 31420034321213 |
6 | 1520543534105 |
7 | 204063222422 |
oct | 36551714131 |
9 | 11566125815 |
10 | 4121401433 |
11 | 1825472996 |
12 | 9702ba335 |
13 | 508b19496 |
14 | 2b1516649 |
15 | 191c55ea8 |
hex | f5a79859 |
4121401433 has 2 divisors, whose sum is σ = 4121401434. Its totient is φ = 4121401432.
The previous prime is 4121401411. The next prime is 4121401451. The reversal of 4121401433 is 3341041214.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2744397769 + 1377003664 = 52387^2 + 37108^2 .
It is a cyclic number.
It is not a de Polignac number, because 4121401433 - 226 = 4054292569 is a prime.
It is a super-4 number, since 4×41214014334 (a number of 40 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4121401399 and 4121401408.
It is not a weakly prime, because it can be changed into another prime (4121401633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2060700716 + 2060700717.
It is an arithmetic number, because the mean of its divisors is an integer number (2060700717).
Almost surely, 24121401433 is an apocalyptic number.
It is an amenable number.
4121401433 is a deficient number, since it is larger than the sum of its proper divisors (1).
4121401433 is an equidigital number, since it uses as much as digits as its factorization.
4121401433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 4121401433 is about 64198.1419746709. The cubic root of 4121401433 is about 1603.3006645814.
Adding to 4121401433 its reverse (3341041214), we get a palindrome (7462442647).
The spelling of 4121401433 in words is "four billion, one hundred twenty-one million, four hundred one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •