Base | Representation |
---|---|
bin | 10101001000100011001000… |
… | …00101010110001000111001 |
3 | 20002112210111222021211220002 |
4 | 22210101210011112020321 |
5 | 22042404131132000341 |
6 | 242501301023042345 |
7 | 12534402562665512 |
oct | 1244214405261071 |
9 | 202483458254802 |
10 | 46473225265721 |
11 | 13898203120851 |
12 | 52669a51403b5 |
13 | 1cc1538956b97 |
14 | b6945d567a09 |
15 | 558d1dded29b |
hex | 2a4464156239 |
46473225265721 has 2 divisors, whose sum is σ = 46473225265722. Its totient is φ = 46473225265720.
The previous prime is 46473225265699. The next prime is 46473225265723. The reversal of 46473225265721 is 12756252237464.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46467889693696 + 5335572025 = 6816736^2 + 73045^2 .
It is a cyclic number.
It is not a de Polignac number, because 46473225265721 - 242 = 42075178754617 is a prime.
It is a super-2 number, since 2×464732252657212 (a number of 28 digits) contains 22 as substring.
Together with 46473225265723, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (46473225265723) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23236612632860 + 23236612632861.
It is an arithmetic number, because the mean of its divisors is an integer number (23236612632861).
Almost surely, 246473225265721 is an apocalyptic number.
It is an amenable number.
46473225265721 is a deficient number, since it is larger than the sum of its proper divisors (1).
46473225265721 is an equidigital number, since it uses as much as digits as its factorization.
46473225265721 is an evil number, because the sum of its binary digits is even.
The product of its digits is 33868800, while the sum is 56.
The spelling of 46473225265721 in words is "forty-six trillion, four hundred seventy-three billion, two hundred twenty-five million, two hundred sixty-five thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •