Base | Representation |
---|---|
bin | 100000010111000111000110… |
… | …011111110001011011001000 |
3 | 200122221012102001122221200210 |
4 | 200113013012133301123020 |
5 | 122123330423321131344 |
6 | 1222411301204201120 |
7 | 41656455366643521 |
oct | 4027070637613310 |
9 | 618835361587623 |
10 | 142325661505224 |
11 | 41392a79551a8a |
12 | 13b678000991a0 |
13 | 615533838b892 |
14 | 272085505d848 |
15 | 116c33c966db9 |
hex | 8171c67f16c8 |
142325661505224 has 64 divisors (see below), whose sum is σ = 356411076480000. Its totient is φ = 47362358283840.
The previous prime is 142325661505151. The next prime is 142325661505229. The reversal of 142325661505224 is 422505166523241.
It is a super-2 number, since 2×1423256615052242 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (142325661505229) 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, 35574109 + ... + 39372179.
It is an arithmetic number, because the mean of its divisors is an integer number (5568923070000).
Almost surely, 2142325661505224 is an apocalyptic number.
It is an amenable number.
142325661505224 is an abundant number, since it is smaller than the sum of its proper divisors (214085414974776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142325661505224 is a wasteful number, since it uses less digits than its factorization.
142325661505224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3800698 (or 3800694 counting only the distinct ones).
The product of its (nonzero) digits is 3456000, while the sum is 48.
The spelling of 142325661505224 in words is "one hundred forty-two trillion, three hundred twenty-five billion, six hundred sixty-one million, five hundred five thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •