Base | Representation |
---|---|
bin | 10101000001000100011101… |
… | …10000000010110101011001 |
3 | 20001122020012102221101211202 |
4 | 22200202032300002311121 |
5 | 22024201331211023103 |
6 | 242143240550403545 |
7 | 12510004405216121 |
oct | 1240421660026531 |
9 | 201566172841752 |
10 | 46216243064153 |
11 | 137a922039a188 |
12 | 52250263605b5 |
13 | 1ca3233184396 |
14 | b5ac4170dc81 |
15 | 5522cd133988 |
hex | 2a088ec02d59 |
46216243064153 has 2 divisors, whose sum is σ = 46216243064154. Its totient is φ = 46216243064152.
The previous prime is 46216243064137. The next prime is 46216243064191. The reversal of 46216243064153 is 35146034261264.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 36592300410649 + 9623942653504 = 6049157^2 + 3102248^2 .
It is a cyclic number.
It is not a de Polignac number, because 46216243064153 - 24 = 46216243064137 is a prime.
It is a super-2 number, since 2×462162430641532 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 46216243064098 and 46216243064107.
It is not a weakly prime, because it can be changed into another prime (46216243064653) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23108121532076 + 23108121532077.
It is an arithmetic number, because the mean of its divisors is an integer number (23108121532077).
Almost surely, 246216243064153 is an apocalyptic number.
It is an amenable number.
46216243064153 is a deficient number, since it is larger than the sum of its proper divisors (1).
46216243064153 is an equidigital number, since it uses as much as digits as its factorization.
46216243064153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2488320, while the sum is 47.
The spelling of 46216243064153 in words is "forty-six trillion, two hundred sixteen billion, two hundred forty-three million, sixty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •