Base | Representation |
---|---|
bin | 100001001110100011000111… |
… | …011101011010100111000111 |
3 | 201011102101210021022001012001 |
4 | 201032203013131122213013 |
5 | 123123240110244000023 |
6 | 1234445345235210131 |
7 | 42531633205636651 |
oct | 4116430735324707 |
9 | 634371707261161 |
10 | 146135313656263 |
11 | 42621702901388 |
12 | 14482004a46947 |
13 | 6370668773509 |
14 | 2812db61736d1 |
15 | 11d64aca496ad |
hex | 84e8c775a9c7 |
146135313656263 has 2 divisors, whose sum is σ = 146135313656264. Its totient is φ = 146135313656262.
The previous prime is 146135313656231. The next prime is 146135313656401. The reversal of 146135313656263 is 362656313531641.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 146135313656263 - 25 = 146135313656231 is a prime.
It is a super-2 number, since 2×1461353136562632 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146135353656263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73067656828131 + 73067656828132.
It is an arithmetic number, because the mean of its divisors is an integer number (73067656828132).
Almost surely, 2146135313656263 is an apocalyptic number.
146135313656263 is a deficient number, since it is larger than the sum of its proper divisors (1).
146135313656263 is an equidigital number, since it uses as much as digits as its factorization.
146135313656263 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20995200, while the sum is 55.
The spelling of 146135313656263 in words is "one hundred forty-six trillion, one hundred thirty-five billion, three hundred thirteen million, six hundred fifty-six thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •