Base | Representation |
---|---|
bin | 10011101111100000111000… |
… | …01100000010000100100111 |
3 | 12200201100010110122110000022 |
4 | 21313300130030002010213 |
5 | 21142243334100003411 |
6 | 232200041202505355 |
7 | 12100362310132631 |
oct | 1167603414020447 |
9 | 180640113573008 |
10 | 43414002344231 |
11 | 12918858582662 |
12 | 4a51b1166525b |
13 | 1b2bbcc68588c |
14 | aa136b09ba51 |
15 | 5044702a1edb |
hex | 277c1c302127 |
43414002344231 has 2 divisors, whose sum is σ = 43414002344232. Its totient is φ = 43414002344230.
The previous prime is 43414002344171. The next prime is 43414002344267. The reversal of 43414002344231 is 13244320041434.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-43414002344231 is a prime.
It is a super-2 number, since 2×434140023442312 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 43414002344191 and 43414002344200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43414002347231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21707001172115 + 21707001172116.
It is an arithmetic number, because the mean of its divisors is an integer number (21707001172116).
Almost surely, 243414002344231 is an apocalyptic number.
43414002344231 is a deficient number, since it is larger than the sum of its proper divisors (1).
43414002344231 is an equidigital number, since it uses as much as digits as its factorization.
43414002344231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 110592, while the sum is 35.
Adding to 43414002344231 its reverse (13244320041434), we get a palindrome (56658322385665).
The spelling of 43414002344231 in words is "forty-three trillion, four hundred fourteen billion, two million, three hundred forty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •