Base | Representation |
---|---|
bin | 1000100000110100011… |
… | …1100000011100101111 |
3 | 111222111100012221001102 |
4 | 2020031013200130233 |
5 | 4344004213203131 |
6 | 151104050433315 |
7 | 13365120434654 |
oct | 2101507403457 |
9 | 458440187042 |
10 | 146248959791 |
11 | 570297a8120 |
12 | 2441659283b |
13 | 10a393c7b3c |
14 | 7115525c2b |
15 | 3c0e6351cb |
hex | 220d1e072f |
146248959791 has 24 divisors (see below), whose sum is σ = 167797234800. Its totient is φ = 126263558400.
The previous prime is 146248959781. The next prime is 146248959869. The reversal of 146248959791 is 197959842641.
It is not a de Polignac number, because 146248959791 - 210 = 146248958767 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146248959721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1125395 + ... + 1248603.
It is an arithmetic number, because the mean of its divisors is an integer number (6991551450).
Almost surely, 2146248959791 is an apocalyptic number.
146248959791 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
146248959791 is a deficient number, since it is larger than the sum of its proper divisors (21548275009).
146248959791 is a wasteful number, since it uses less digits than its factorization.
146248959791 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123371 (or 123310 counting only the distinct ones).
The product of its digits is 39191040, while the sum is 65.
The spelling of 146248959791 in words is "one hundred forty-six billion, two hundred forty-eight million, nine hundred fifty-nine thousand, seven hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •