Base | Representation |
---|---|
bin | 100001010010100101001001… |
… | …101101001000101100100100 |
3 | 201012101212221021100002120012 |
4 | 201102211021231020230210 |
5 | 123142310021420102322 |
6 | 1235220530050225352 |
7 | 42560642120066426 |
oct | 4122451155105444 |
9 | 635355837302505 |
10 | 146412376722212 |
11 | 4271915a773637 |
12 | 14507848885258 |
13 | 63908215c45a3 |
14 | 282257ad22816 |
15 | 11dd7c6704ae2 |
hex | 852949b48b24 |
146412376722212 has 12 divisors (see below), whose sum is σ = 261056030193756. Its totient is φ = 71824939524000.
The previous prime is 146412376722193. The next prime is 146412376722253. The reversal of 146412376722212 is 212227673214641.
146412376722212 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 104486544521956 + 41925832200256 = 10221866^2 + 6475016^2 .
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 3 ways as a sum of consecutive naturals, for example, 345312209039 + ... + 345312209462.
It is an arithmetic number, because the mean of its divisors is an integer number (21754669182813).
Almost surely, 2146412376722212 is an apocalyptic number.
It is an amenable number.
146412376722212 is a deficient number, since it is larger than the sum of its proper divisors (114643653471544).
146412376722212 is a wasteful number, since it uses less digits than its factorization.
146412376722212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690624418558 (or 690624418556 counting only the distinct ones).
The product of its digits is 2709504, while the sum is 50.
The spelling of 146412376722212 in words is "one hundred forty-six trillion, four hundred twelve billion, three hundred seventy-six million, seven hundred twenty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •