Base | Representation |
---|---|
bin | 10100111111010100111001… |
… | …00111011101001001000101 |
3 | 20001102111121010022222100011 |
4 | 22133222130213131021011 |
5 | 22022211144103321433 |
6 | 242055533243550221 |
7 | 12502454166652444 |
oct | 1237523447351105 |
9 | 201374533288304 |
10 | 46156346151493 |
11 | 13785884122176 |
12 | 52154aab2b371 |
13 | 1c9a6a8bac026 |
14 | b57d9c812d5b |
15 | 5509749953cd |
hex | 29fa9c9dd245 |
46156346151493 has 2 divisors, whose sum is σ = 46156346151494. Its totient is φ = 46156346151492.
The previous prime is 46156346151491. The next prime is 46156346151497. The reversal of 46156346151493 is 39415164365164.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 40071406719204 + 6084939432289 = 6330198^2 + 2466767^2 .
It is a cyclic number.
It is not a de Polignac number, because 46156346151493 - 21 = 46156346151491 is a prime.
It is a super-2 number, since 2×461563461514932 (a number of 28 digits) contains 22 as substring.
Together with 46156346151491, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (46156346151491) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23078173075746 + 23078173075747.
It is an arithmetic number, because the mean of its divisors is an integer number (23078173075747).
Almost surely, 246156346151493 is an apocalyptic number.
It is an amenable number.
46156346151493 is a deficient number, since it is larger than the sum of its proper divisors (1).
46156346151493 is an equidigital number, since it uses as much as digits as its factorization.
46156346151493 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 27993600, while the sum is 58.
The spelling of 46156346151493 in words is "forty-six trillion, one hundred fifty-six billion, three hundred forty-six million, one hundred fifty-one thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •