Base | Representation |
---|---|
bin | 1000100000000000100… |
… | …0111010010101001101 |
3 | 111221221011111210220002 |
4 | 2020000020322111031 |
5 | 4343032443133031 |
6 | 151030311534045 |
7 | 13356534632105 |
oct | 2100010722515 |
9 | 457834453802 |
10 | 146031224141 |
11 | 56a27901100 |
12 | 2437568a325 |
13 | 10a03270c8a |
14 | 70d4648205 |
15 | 3bea475ccb |
hex | 220023a54d |
146031224141 has 24 divisors (see below), whose sum is σ = 161094047520. Its totient is φ = 132276624480.
The previous prime is 146031224123. The next prime is 146031224147. The reversal of 146031224141 is 141422130641.
It is not a de Polignac number, because 146031224141 - 226 = 145964115277 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146031224147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 44806970 + ... + 44810228.
It is an arithmetic number, because the mean of its divisors is an integer number (6712251980).
Almost surely, 2146031224141 is an apocalyptic number.
146031224141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
146031224141 is a deficient number, since it is larger than the sum of its proper divisors (15062823379).
146031224141 is a wasteful number, since it uses less digits than its factorization.
146031224141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4505 (or 4494 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 146031224141 its reverse (141422130641), we get a palindrome (287453354782).
The spelling of 146031224141 in words is "one hundred forty-six billion, thirty-one million, two hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •