Base | Representation |
---|---|
bin | 100101011110110000… |
… | …010100010100110011 |
3 | 10211212200222212121022 |
4 | 211132300110110303 |
5 | 1124410033231011 |
6 | 30253225450055 |
7 | 2623203004043 |
oct | 453660242463 |
9 | 124780885538 |
10 | 40244430131 |
11 | 16081a28014 |
12 | 797194092b |
13 | 3a448c4989 |
14 | 1d3ac37723 |
15 | 10a81ba8db |
hex | 95ec14533 |
40244430131 has 2 divisors, whose sum is σ = 40244430132. Its totient is φ = 40244430130.
The previous prime is 40244430077. The next prime is 40244430133. The reversal of 40244430131 is 13103444204.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 40244430131 - 226 = 40177321267 is a prime.
It is a super-2 number, since 2×402444301312 (a number of 22 digits) contains 22 as substring.
Together with 40244430133, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 40244430131.
It is not a weakly prime, because it can be changed into another prime (40244430133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20122215065 + 20122215066.
It is an arithmetic number, because the mean of its divisors is an integer number (20122215066).
Almost surely, 240244430131 is an apocalyptic number.
40244430131 is a deficient number, since it is larger than the sum of its proper divisors (1).
40244430131 is an equidigital number, since it uses as much as digits as its factorization.
40244430131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 40244430131 its reverse (13103444204), we get a palindrome (53347874335).
The spelling of 40244430131 in words is "forty billion, two hundred forty-four million, four hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •