Base | Representation |
---|---|
bin | 101000001011100001… |
… | …011101101001101101 |
3 | 11010100201011012110201 |
4 | 220023201131221231 |
5 | 1201324101311131 |
6 | 31453012033501 |
7 | 3055060255123 |
oct | 501341355155 |
9 | 133321135421 |
10 | 43142994541 |
11 | 1732a106399 |
12 | 8440602891 |
13 | 40b728214a |
14 | 2133b97913 |
15 | 11c78c4761 |
hex | a0b85da6d |
43142994541 has 2 divisors, whose sum is σ = 43142994542. Its totient is φ = 43142994540.
The previous prime is 43142994527. The next prime is 43142994607. The reversal of 43142994541 is 14549924134.
43142994541 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27703938025 + 15439056516 = 166445^2 + 124254^2 .
It is a cyclic number.
It is not a de Polignac number, because 43142994541 - 25 = 43142994509 is a prime.
It is a super-2 number, since 2×431429945412 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 43142994491 and 43142994500.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43142994341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21571497270 + 21571497271.
It is an arithmetic number, because the mean of its divisors is an integer number (21571497271).
Almost surely, 243142994541 is an apocalyptic number.
It is an amenable number.
43142994541 is a deficient number, since it is larger than the sum of its proper divisors (1).
43142994541 is an equidigital number, since it uses as much as digits as its factorization.
43142994541 is an evil number, because the sum of its binary digits is even.
The product of its digits is 622080, while the sum is 46.
The spelling of 43142994541 in words is "forty-three billion, one hundred forty-two million, nine hundred ninety-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •