Base | Representation |
---|---|
bin | 101011011110100100… |
… | …000000000000000001 |
3 | 11110111110112020112202 |
4 | 223132210000000001 |
5 | 1231102003331342 |
6 | 33240212402545 |
7 | 3241602331655 |
oct | 533644000001 |
9 | 143443466482 |
10 | 46683652097 |
11 | 18886782865 |
12 | 906a316455 |
13 | 452c9856a4 |
14 | 238c0daa65 |
15 | 1333663332 |
hex | ade900001 |
46683652097 has 2 divisors, whose sum is σ = 46683652098. Its totient is φ = 46683652096.
The previous prime is 46683651979. The next prime is 46683652217. The reversal of 46683652097 is 79025638664.
It is a happy number.
It is a Cunningham number, because it is equal to 2160642+1.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 46683652096 + 1 = 216064^2 + 1^2 .
It is a cyclic number.
It is not a de Polignac number, because 46683652097 - 230 = 45609910273 is a prime.
It is a super-2 number, since 2×466836520972 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (46683652297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23341826048 + 23341826049.
It is an arithmetic number, because the mean of its divisors is an integer number (23341826049).
It is a Proth number, since it is equal to 44521 ⋅ 220 + 1 and 44521 < 220.
Almost surely, 246683652097 is an apocalyptic number.
It is an amenable number.
46683652097 is a deficient number, since it is larger than the sum of its proper divisors (1).
46683652097 is an equidigital number, since it uses as much as digits as its factorization.
46683652097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13063680, while the sum is 56.
The spelling of 46683652097 in words is "forty-six billion, six hundred eighty-three million, six hundred fifty-two thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •