Base | Representation |
---|---|
bin | 1000011111111110011… |
… | …1011101001110000001 |
3 | 111221220120000020201102 |
4 | 2013333213131032001 |
5 | 4343023222013040 |
6 | 151025355544145 |
7 | 13356400244441 |
oct | 2077747351601 |
9 | 457816006642 |
10 | 146022454145 |
11 | 56a22961077 |
12 | 2437275b055 |
13 | 10a014c0229 |
14 | 70d3404121 |
15 | 3be97e2515 |
hex | 21ff9dd381 |
146022454145 has 8 divisors (see below), whose sum is σ = 175229653056. Its totient is φ = 116816157936.
The previous prime is 146022454141. The next prime is 146022454147. The reversal of 146022454145 is 541454220641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 146022454145 - 22 = 146022454141 is a prime.
It is a super-2 number, since 2×1460224541452 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146022454099 and 146022454108.
It is not an unprimeable number, because it can be changed into a prime (146022454141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 204884 + ... + 577946.
It is an arithmetic number, because the mean of its divisors is an integer number (21903706632).
Almost surely, 2146022454145 is an apocalyptic number.
It is an amenable number.
146022454145 is a deficient number, since it is larger than the sum of its proper divisors (29207198911).
146022454145 is an equidigital number, since it uses as much as digits as its factorization.
146022454145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 451351.
The product of its (nonzero) digits is 153600, while the sum is 38.
Adding to 146022454145 its reverse (541454220641), we get a palindrome (687476674786).
The spelling of 146022454145 in words is "one hundred forty-six billion, twenty-two million, four hundred fifty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •