Base | Representation |
---|---|
bin | 100001010110001100010011… |
… | …110101011111111100000110 |
3 | 201020021121121001120020211202 |
4 | 201112030103311133330012 |
5 | 123210341332222014240 |
6 | 1235530535114302502 |
7 | 42614606630046545 |
oct | 4126142365377406 |
9 | 636247531506752 |
10 | 146660581048070 |
11 | 42804448628271 |
12 | 14547977a27a32 |
13 | 63ab0586493ab |
14 | 28305a506615c |
15 | 11e4ea1a6c315 |
hex | 856313d5ff06 |
146660581048070 has 16 divisors (see below), whose sum is σ = 275466830490720. Its totient is φ = 56113613618304.
The previous prime is 146660581048063. The next prime is 146660581048141. The reversal of 146660581048070 is 70840185066641.
146660581048070 is digitally balanced in base 3, 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 = 146660581047997 and 146660581048015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 318827349875 + ... + 318827350334.
It is an arithmetic number, because the mean of its divisors is an integer number (17216676905670).
Almost surely, 2146660581048070 is an apocalyptic number.
146660581048070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
146660581048070 is a deficient number, since it is larger than the sum of its proper divisors (128806249442650).
146660581048070 is a wasteful number, since it uses less digits than its factorization.
146660581048070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 637654700239.
The product of its (nonzero) digits is 7741440, while the sum is 56.
The spelling of 146660581048070 in words is "one hundred forty-six trillion, six hundred sixty billion, five hundred eighty-one million, forty-eight thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •