Base | Representation |
---|---|
bin | 101010111100010100… |
… | …001101010011100111 |
3 | 11102000102101022100011 |
4 | 222330110031103213 |
5 | 1223412411240301 |
6 | 33103205431051 |
7 | 3221424525634 |
oct | 527424152347 |
9 | 142012338304 |
10 | 46109086951 |
11 | 18611417534 |
12 | 8b29a0b487 |
13 | 446a923c05 |
14 | 2335a9518b |
15 | 12ecebba51 |
hex | abc50d4e7 |
46109086951 has 2 divisors, whose sum is σ = 46109086952. Its totient is φ = 46109086950.
The previous prime is 46109086853. The next prime is 46109087009. The reversal of 46109086951 is 15968090164.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 46109086951 - 27 = 46109086823 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 46109086895 and 46109086904.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (46109087951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23054543475 + 23054543476.
It is an arithmetic number, because the mean of its divisors is an integer number (23054543476).
Almost surely, 246109086951 is an apocalyptic number.
46109086951 is a deficient number, since it is larger than the sum of its proper divisors (1).
46109086951 is an equidigital number, since it uses as much as digits as its factorization.
46109086951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 466560, while the sum is 49.
The spelling of 46109086951 in words is "forty-six billion, one hundred nine million, eighty-six thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •