Base | Representation |
---|---|
bin | 1000001111110010001… |
… | …1001000001111000011 |
3 | 111112200122102112220000 |
4 | 2003330203020033003 |
5 | 4310123030130200 |
6 | 145030212451043 |
7 | 13143602206650 |
oct | 2037443101703 |
9 | 445618375800 |
10 | 141676020675 |
11 | 550a24692a2 |
12 | 2355b019a83 |
13 | 1048ab93ac7 |
14 | 6c00070c27 |
15 | 3a42e3a300 |
hex | 20fc8c83c3 |
141676020675 has 120 divisors (see below), whose sum is σ = 300585094656. Its totient is φ = 64623303360.
The previous prime is 141676020637. The next prime is 141676020679. The reversal of 141676020675 is 576020676141.
It is not a de Polignac number, because 141676020675 - 222 = 141671826371 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 141676020675.
It is not an unprimeable number, because it can be changed into a prime (141676020679) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 6552232 + ... + 6573818.
Almost surely, 2141676020675 is an apocalyptic number.
141676020675 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
141676020675 is an abundant number, since it is smaller than the sum of its proper divisors (158909073981).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141676020675 is a wasteful number, since it uses less digits than its factorization.
141676020675 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22079 (or 22065 counting only the distinct ones).
The product of its (nonzero) digits is 423360, while the sum is 45.
The spelling of 141676020675 in words is "one hundred forty-one billion, six hundred seventy-six million, twenty thousand, six hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •