Base | Representation |
---|---|
bin | 100001010010101000111101… |
… | …001110001100001010011011 |
3 | 201012102021110222222102222022 |
4 | 201102220331032030022123 |
5 | 123142341403314010101 |
6 | 1235222443313245055 |
7 | 42561145266363155 |
oct | 4122507516141233 |
9 | 635367428872868 |
10 | 146416462250651 |
11 | 4271a96696461a |
12 | 145085a8b6378b |
13 | 6391022b60838 |
14 | 282284777bad5 |
15 | 11dd965221a1b |
hex | 852a3d38c29b |
146416462250651 has 2 divisors, whose sum is σ = 146416462250652. Its totient is φ = 146416462250650.
The previous prime is 146416462250627. The next prime is 146416462250683. The reversal of 146416462250651 is 156052264614641.
It is a weak prime.
It is an emirp because it is prime and its reverse (156052264614641) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 146416462250651 - 210 = 146416462249627 is a prime.
It is a super-3 number, since 3×1464164622506513 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 146416462250593 and 146416462250602.
It is not a weakly prime, because it can be changed into another prime (146416462259651) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73208231125325 + 73208231125326.
It is an arithmetic number, because the mean of its divisors is an integer number (73208231125326).
Almost surely, 2146416462250651 is an apocalyptic number.
146416462250651 is a deficient number, since it is larger than the sum of its proper divisors (1).
146416462250651 is an equidigital number, since it uses as much as digits as its factorization.
146416462250651 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8294400, while the sum is 53.
The spelling of 146416462250651 in words is "one hundred forty-six trillion, four hundred sixteen billion, four hundred sixty-two million, two hundred fifty thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •