Base | Representation |
---|---|
bin | 101000001011100011… |
… | …001101001100111101 |
3 | 11010100202000102020101 |
4 | 220023203031030331 |
5 | 1201324210421303 |
6 | 31453025521101 |
7 | 3055064200204 |
oct | 501343151475 |
9 | 133322012211 |
10 | 43143451453 |
11 | 1732a398703 |
12 | 84407a3191 |
13 | 40b73b20cb |
14 | 2133c7623b |
15 | 11c7964d1d |
hex | a0b8cd33d |
43143451453 has 2 divisors, whose sum is σ = 43143451454. Its totient is φ = 43143451452.
The previous prime is 43143451427. The next prime is 43143451469. The reversal of 43143451453 is 35415434134.
43143451453 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31192151769 + 11951299684 = 176613^2 + 109322^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-43143451453 is a prime.
It is a super-2 number, since 2×431434514532 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43143458453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21571725726 + 21571725727.
It is an arithmetic number, because the mean of its divisors is an integer number (21571725727).
Almost surely, 243143451453 is an apocalyptic number.
It is an amenable number.
43143451453 is a deficient number, since it is larger than the sum of its proper divisors (1).
43143451453 is an equidigital number, since it uses as much as digits as its factorization.
43143451453 is an evil number, because the sum of its binary digits is even.
The product of its digits is 172800, while the sum is 37.
Adding to 43143451453 its reverse (35415434134), we get a palindrome (78558885587).
The spelling of 43143451453 in words is "forty-three billion, one hundred forty-three million, four hundred fifty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •