Base | Representation |
---|---|
bin | 100001001101010000010001… |
… | …001100011111011011101011 |
3 | 201011002220011200120020110010 |
4 | 201031100101030133123223 |
5 | 123120310414220422311 |
6 | 1234340434145023003 |
7 | 42522333600623613 |
oct | 4115202114373353 |
9 | 634086150506403 |
10 | 146046356420331 |
11 | 42597a03862384 |
12 | 14468919324a63 |
13 | 636515c9b20c3 |
14 | 280c977955a43 |
15 | 11d4002ee9da6 |
hex | 84d41131f6eb |
146046356420331 has 8 divisors (see below), whose sum is σ = 194729558848144. Its totient is φ = 97363695803040.
The previous prime is 146046356420291. The next prime is 146046356420351. The reversal of 146046356420331 is 133024653640641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 146046356420331 - 227 = 146046222202603 is a prime.
It is a super-2 number, since 2×1460463564203312 (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 (146046356420351) 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 7 ways as a sum of consecutive naturals, for example, 134823256 + ... + 135902181.
It is an arithmetic number, because the mean of its divisors is an integer number (24341194856018).
Almost surely, 2146046356420331 is an apocalyptic number.
146046356420331 is a deficient number, since it is larger than the sum of its proper divisors (48683202427813).
146046356420331 is a wasteful number, since it uses less digits than its factorization.
146046356420331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270905261.
The product of its (nonzero) digits is 3732480, while the sum is 48.
The spelling of 146046356420331 in words is "one hundred forty-six trillion, forty-six billion, three hundred fifty-six million, four hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •