Base | Representation |
---|---|
bin | 101011001000111010… |
… | …000001000110101001 |
3 | 11102120010212022111211 |
4 | 223020322001012221 |
5 | 1224331000400113 |
6 | 33140153153121 |
7 | 3226601160253 |
oct | 531072010651 |
9 | 142503768454 |
10 | 46320325033 |
11 | 1870a685864 |
12 | 8b886bb7a1 |
13 | 44a2614468 |
14 | 2355b60cd3 |
15 | 13117e5b3d |
hex | ac8e811a9 |
46320325033 has 2 divisors, whose sum is σ = 46320325034. Its totient is φ = 46320325032.
The previous prime is 46320325031. The next prime is 46320325069. The reversal of 46320325033 is 33052302364.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 46288661904 + 31663129 = 215148^2 + 5627^2 .
It is a cyclic number.
It is not a de Polignac number, because 46320325033 - 21 = 46320325031 is a prime.
It is a super-2 number, since 2×463203250332 (a number of 22 digits) contains 22 as substring.
Together with 46320325031, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 46320324986 and 46320325004.
It is not a weakly prime, because it can be changed into another prime (46320325031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23160162516 + 23160162517.
It is an arithmetic number, because the mean of its divisors is an integer number (23160162517).
Almost surely, 246320325033 is an apocalyptic number.
It is an amenable number.
46320325033 is a deficient number, since it is larger than the sum of its proper divisors (1).
46320325033 is an equidigital number, since it uses as much as digits as its factorization.
46320325033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 31.
Adding to 46320325033 its reverse (33052302364), we get a palindrome (79372627397).
The spelling of 46320325033 in words is "forty-six billion, three hundred twenty million, three hundred twenty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •