Base | Representation |
---|---|
bin | 1000100000101010101… |
… | …1001110111110010110 |
3 | 111222101111010122012122 |
4 | 2020022223032332112 |
5 | 4343413221300000 |
6 | 151100024415542 |
7 | 13364112304310 |
oct | 2101253167626 |
9 | 458344118178 |
10 | 146207993750 |
11 | 57008667795 |
12 | 244049175b2 |
13 | 10a30a83690 |
14 | 710dd007b0 |
15 | 3c0ac42085 |
hex | 220aacef96 |
146207993750 has 96 divisors (see below), whose sum is σ = 337382781120. Its totient is φ = 46272240000.
The previous prime is 146207993749. The next prime is 146207993797. The reversal of 146207993750 is 57399702641.
146207993750 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 146207993692 and 146207993701.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 440216 + ... + 697284.
It is an arithmetic number, because the mean of its divisors is an integer number (3514403970).
Almost surely, 2146207993750 is an apocalyptic number.
146207993750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
146207993750 is an abundant number, since it is smaller than the sum of its proper divisors (191174787370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146207993750 is an equidigital number, since it uses as much as digits as its factorization.
146207993750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257116 (or 257096 counting only the distinct ones).
The product of its (nonzero) digits is 2857680, while the sum is 53.
The spelling of 146207993750 in words is "one hundred forty-six billion, two hundred seven million, nine hundred ninety-three thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •