Base | Representation |
---|---|
bin | 100000111110101010000110… |
… | …111110101100000011100010 |
3 | 201000120000010200002001221120 |
4 | 200332222012332230003202 |
5 | 123002342144400304432 |
6 | 1232251550554433110 |
7 | 42360014303265405 |
oct | 4076520676540342 |
9 | 630500120061846 |
10 | 145043310166242 |
11 | 42240582354724 |
12 | 14326447132796 |
13 | 62c16aa588967 |
14 | 27b61c2b05d3c |
15 | 11b7d99104c2c |
hex | 83ea86fac0e2 |
145043310166242 has 32 divisors (see below), whose sum is σ = 293116307696640. Its totient is φ = 47845445268480.
The previous prime is 145043310166199. The next prime is 145043310166247. The reversal of 145043310166242 is 242661013340541.
It is a junction number, because it is equal to n+sod(n) for n = 145043310166194 and 145043310166203.
It is not an unprimeable number, because it can be changed into a prime (145043310166247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 327667017 + ... + 328109372.
It is an arithmetic number, because the mean of its divisors is an integer number (9159884615520).
Almost surely, 2145043310166242 is an apocalyptic number.
145043310166242 is an abundant number, since it is smaller than the sum of its proper divisors (148072997530398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145043310166242 is a wasteful number, since it uses less digits than its factorization.
145043310166242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 655776778.
The product of its (nonzero) digits is 414720, while the sum is 42.
The spelling of 145043310166242 in words is "one hundred forty-five trillion, forty-three billion, three hundred ten million, one hundred sixty-six thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •