Base | Representation |
---|---|
bin | 100001001101111100010010… |
… | …000100100011011010000001 |
3 | 201011021102011021100021200001 |
4 | 201031330102010203122001 |
5 | 123122044211113210204 |
6 | 1234414251444400001 |
7 | 42525625663433221 |
oct | 4115742204433201 |
9 | 634242137307601 |
10 | 146093615756929 |
11 | 42605a55495455 |
12 | 14475b083a6001 |
13 | 63697519cb8b9 |
14 | 2810d7c2aa081 |
15 | 11d536be764a4 |
hex | 84df12123681 |
146093615756929 has 16 divisors (see below), whose sum is σ = 149326696981440. Its totient is φ = 142885792082880.
The previous prime is 146093615756827. The next prime is 146093615756953. The reversal of 146093615756929 is 929657516390641.
It is a cyclic number.
It is not a de Polignac number, because 146093615756929 - 223 = 146093607368321 is a prime.
It is a super-2 number, since 2×1460936157569292 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (146093615753929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1001027647 + ... + 1001173579.
It is an arithmetic number, because the mean of its divisors is an integer number (9332918561340).
Almost surely, 2146093615756929 is an apocalyptic number.
It is an amenable number.
146093615756929 is a deficient number, since it is larger than the sum of its proper divisors (3233081224511).
146093615756929 is a wasteful number, since it uses less digits than its factorization.
146093615756929 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232320.
The product of its (nonzero) digits is 661348800, while the sum is 73.
The spelling of 146093615756929 in words is "one hundred forty-six trillion, ninety-three billion, six hundred fifteen million, seven hundred fifty-six thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •