Base | Representation |
---|---|
bin | 1000100000010011100… |
… | …0111111001101011101 |
3 | 111222010201111120212111 |
4 | 2020010320333031131 |
5 | 4343213344422101 |
6 | 151042240234021 |
7 | 13361523314650 |
oct | 2100470771535 |
9 | 458121446774 |
10 | 146110935901 |
11 | 56a688a5797 |
12 | 2439830b911 |
13 | 10a169300b8 |
14 | 7101077897 |
15 | 3c0246e251 |
hex | 2204e3f35d |
146110935901 has 16 divisors (see below), whose sum is σ = 176201913600. Its totient is φ = 118446818688.
The previous prime is 146110935889. The next prime is 146110935917. The reversal of 146110935901 is 109539011641.
146110935901 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 146110935901 - 211 = 146110933853 is a prime.
It is a super-2 number, since 2×1461109359012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146110935941) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 5084106 + ... + 5112763.
It is an arithmetic number, because the mean of its divisors is an integer number (11012619600).
Almost surely, 2146110935901 is an apocalyptic number.
It is an amenable number.
146110935901 is a deficient number, since it is larger than the sum of its proper divisors (30090977699).
146110935901 is a wasteful number, since it uses less digits than its factorization.
146110935901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10196988.
The product of its (nonzero) digits is 29160, while the sum is 40.
The spelling of 146110935901 in words is "one hundred forty-six billion, one hundred ten million, nine hundred thirty-five thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •