Base | Representation |
---|---|
bin | 111010110101010101110… |
… | …101000111001110100011 |
3 | 112022111200220201000201121 |
4 | 322311111311013032203 |
5 | 1012220033034242011 |
6 | 12333155215313111 |
7 | 565045261531633 |
oct | 72652565071643 |
9 | 15274626630647 |
10 | 4043004212131 |
11 | 13196a0527755 |
12 | 553689b1b797 |
13 | 23433b3a87c1 |
14 | dd97a8cc6c3 |
15 | 7027b5b8e71 |
hex | 3ad55d473a3 |
4043004212131 has 2 divisors, whose sum is σ = 4043004212132. Its totient is φ = 4043004212130.
The previous prime is 4043004212123. The next prime is 4043004212141. The reversal of 4043004212131 is 1312124003404.
4043004212131 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4043004212131 - 23 = 4043004212123 is a prime.
It is a super-2 number, since 2×40430042121312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4043004212096 and 4043004212105.
It is not a weakly prime, because it can be changed into another prime (4043004212141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2021502106065 + 2021502106066.
It is an arithmetic number, because the mean of its divisors is an integer number (2021502106066).
Almost surely, 24043004212131 is an apocalyptic number.
4043004212131 is a deficient number, since it is larger than the sum of its proper divisors (1).
4043004212131 is an equidigital number, since it uses as much as digits as its factorization.
4043004212131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 4043004212131 its reverse (1312124003404), we get a palindrome (5355128215535).
The spelling of 4043004212131 in words is "four trillion, forty-three billion, four million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •