Base | Representation |
---|---|
bin | 1100101000100100110… |
… | …11111100001111101001 |
3 | 1112111111020122020110021 |
4 | 12110102123330033221 |
5 | 24103014324331213 |
6 | 531231231120441 |
7 | 43235266500265 |
oct | 6242233741751 |
9 | 1474436566407 |
10 | 434101011433 |
11 | 158112781a81 |
12 | 7016b673121 |
13 | 31c21530b0b |
14 | 170211370a5 |
15 | b45a59bd8d |
hex | 65126fc3e9 |
434101011433 has 2 divisors, whose sum is σ = 434101011434. Its totient is φ = 434101011432.
The previous prime is 434101011359. The next prime is 434101011467. The reversal of 434101011433 is 334110101434.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 406314455184 + 27786556249 = 637428^2 + 166693^2 .
It is a cyclic number.
It is not a de Polignac number, because 434101011433 - 217 = 434100880361 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 434101011398 and 434101011407.
It is not a weakly prime, because it can be changed into another prime (434101011833) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 217050505716 + 217050505717.
It is an arithmetic number, because the mean of its divisors is an integer number (217050505717).
Almost surely, 2434101011433 is an apocalyptic number.
It is an amenable number.
434101011433 is a deficient number, since it is larger than the sum of its proper divisors (1).
434101011433 is an equidigital number, since it uses as much as digits as its factorization.
434101011433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 434101011433 its reverse (334110101434), we get a palindrome (768211112867).
Subtracting from 434101011433 its reverse (334110101434), we obtain a palindrome (99990909999).
The spelling of 434101011433 in words is "four hundred thirty-four billion, one hundred one million, eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •