Base | Representation |
---|---|
bin | 1000100001011110000… |
… | …0101001111111100001 |
3 | 111222221111022120122211 |
4 | 2020113200221333201 |
5 | 4344333332342031 |
6 | 151133240002121 |
7 | 13402335503206 |
oct | 2102740517741 |
9 | 458844276584 |
10 | 146423324641 |
11 | 57109171000 |
12 | 24464a60341 |
13 | 10a66577ac9 |
14 | 7130753cad |
15 | 3c1eac8bb1 |
hex | 2217829fe1 |
146423324641 has 32 divisors (see below), whose sum is σ = 165608335872. Its totient is φ = 129373200000.
The previous prime is 146423324557. The next prime is 146423324659.
146423324641 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 146423324641 - 29 = 146423324129 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146423324594 and 146423324603.
It is not an unprimeable number, because it can be changed into a prime (146423354641) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14783791 + ... + 14793691.
It is an arithmetic number, because the mean of its divisors is an integer number (5175260496).
Almost surely, 2146423324641 is an apocalyptic number.
146423324641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
146423324641 is a deficient number, since it is larger than the sum of its proper divisors (19185011231).
146423324641 is an equidigital number, since it uses as much as digits as its factorization.
146423324641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10246 (or 10224 counting only the distinct ones).
The product of its digits is 331776, while the sum is 40.
The spelling of 146423324641 in words is "one hundred forty-six billion, four hundred twenty-three million, three hundred twenty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •