Base | Representation |
---|---|
bin | 100001010101111011011010… |
… | …111010000001010001001011 |
3 | 201020012212210012101112122201 |
4 | 201111323122322001101023 |
5 | 123210042212143001132 |
6 | 1235514335410501031 |
7 | 42613365342161152 |
oct | 4125733272012113 |
9 | 636185705345581 |
10 | 146642446062667 |
11 | 427a7791929325 |
12 | 14544356594777 |
13 | 63a94284760b9 |
14 | 282d76473c599 |
15 | 11e478e8ed2e7 |
hex | 855edae8144b |
146642446062667 has 16 divisors (see below), whose sum is σ = 147525226992000. Its totient is φ = 145761921313344.
The previous prime is 146642446062653. The next prime is 146642446062691. The reversal of 146642446062667 is 766260644246641.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-146642446062667 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146642446062599 and 146642446062608.
It is not an unprimeable number, because it can be changed into a prime (146642446062647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 776699884 + ... + 776888662.
It is an arithmetic number, because the mean of its divisors is an integer number (9220326687000).
Almost surely, 2146642446062667 is an apocalyptic number.
146642446062667 is a deficient number, since it is larger than the sum of its proper divisors (882780929333).
146642446062667 is a wasteful number, since it uses less digits than its factorization.
146642446062667 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194730.
The product of its (nonzero) digits is 334430208, while the sum is 64.
The spelling of 146642446062667 in words is "one hundred forty-six trillion, six hundred forty-two billion, four hundred forty-six million, sixty-two thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •