Base | Representation |
---|---|
bin | 1000010000100100010… |
… | …1100100011010110001 |
3 | 111120020022020200121012 |
4 | 2010021011210122301 |
5 | 4311040403004401 |
6 | 145103125240305 |
7 | 13152035202425 |
oct | 2041105443261 |
9 | 446208220535 |
10 | 141886375601 |
11 | 551a0184043 |
12 | 235b9563095 |
13 | 104c2635389 |
14 | 6c1dd8ab85 |
15 | 3a5663c8bb |
hex | 21091646b1 |
141886375601 has 8 divisors (see below), whose sum is σ = 149885594400. Its totient is φ = 133940308320.
The previous prime is 141886375591. The next prime is 141886375621. The reversal of 141886375601 is 106573688141.
It is a happy number.
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 141886375601 - 222 = 141882181297 is a prime.
It is a super-2 number, since 2×1418863756012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 141886375601.
It is not an unprimeable number, because it can be changed into a prime (141886375621) 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, 13282391 + ... + 13293068.
It is an arithmetic number, because the mean of its divisors is an integer number (18735699300).
Almost surely, 2141886375601 is an apocalyptic number.
It is an amenable number.
141886375601 is a deficient number, since it is larger than the sum of its proper divisors (7999218799).
141886375601 is a wasteful number, since it uses less digits than its factorization.
141886375601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26575759.
The product of its (nonzero) digits is 967680, while the sum is 50.
The spelling of 141886375601 in words is "one hundred forty-one billion, eight hundred eighty-six million, three hundred seventy-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •