Base | Representation |
---|---|
bin | 10100111110101111100110… |
… | …01010110001101001100111 |
3 | 20001100120220201000112222102 |
4 | 22133113303022301221213 |
5 | 22021344142243232011 |
6 | 242042422343122315 |
7 | 12501145050340352 |
oct | 1237276312615147 |
9 | 201316821015872 |
10 | 46136323414631 |
11 | 1377833988365a |
12 | 521164144339b |
13 | 1c988378a3338 |
14 | b5701d4cd299 |
15 | 5501a1c3773b |
hex | 29f5f32b1a67 |
46136323414631 has 2 divisors, whose sum is σ = 46136323414632. Its totient is φ = 46136323414630.
The previous prime is 46136323414613. The next prime is 46136323414669. The reversal of 46136323414631 is 13641432363164.
Together with previous prime (46136323414613) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-46136323414631 is a prime.
It is a super-2 number, since 2×461363234146312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (46136323414331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23068161707315 + 23068161707316.
It is an arithmetic number, because the mean of its divisors is an integer number (23068161707316).
Almost surely, 246136323414631 is an apocalyptic number.
46136323414631 is a deficient number, since it is larger than the sum of its proper divisors (1).
46136323414631 is an equidigital number, since it uses as much as digits as its factorization.
46136323414631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2239488, while the sum is 47.
Adding to 46136323414631 its reverse (13641432363164), we get a palindrome (59777755777795).
The spelling of 46136323414631 in words is "forty-six trillion, one hundred thirty-six billion, three hundred twenty-three million, four hundred fourteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •