Base | Representation |
---|---|
bin | 1000001111101111001… |
… | …0001111110101010100 |
3 | 111112122202022112110211 |
4 | 2003323302033311110 |
5 | 4310111240103430 |
6 | 145025034055204 |
7 | 13143355250356 |
oct | 2037362176524 |
9 | 445582275424 |
10 | 141663206740 |
11 | 55096206a70 |
12 | 2355687a504 |
13 | 104883284b3 |
14 | 6bdc4970d6 |
15 | 3a41c5872a |
hex | 20fbc8fd54 |
141663206740 has 96 divisors (see below), whose sum is σ = 337042911744. Its totient is φ = 49564690560.
The previous prime is 141663206701. The next prime is 141663206819. The reversal of 141663206740 is 47602366141.
It is a junction number, because it is equal to n+sod(n) for n = 141663206693 and 141663206702.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 522067 + ... + 745573.
It is an arithmetic number, because the mean of its divisors is an integer number (3510863664).
Almost surely, 2141663206740 is an apocalyptic number.
141663206740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 141663206740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (168521455872).
141663206740 is an abundant number, since it is smaller than the sum of its proper divisors (195379705004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141663206740 is a wasteful number, since it uses less digits than its factorization.
141663206740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223637 (or 223635 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 40.
The spelling of 141663206740 in words is "one hundred forty-one billion, six hundred sixty-three million, two hundred six thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •