Base | Representation |
---|---|
bin | 1000001101010101110… |
… | …0100110111100000000 |
3 | 111110222221000020200222 |
4 | 2003111130212330000 |
5 | 4302302110000000 |
6 | 144441140002212 |
7 | 13121415136145 |
oct | 2032534467400 |
9 | 443887006628 |
10 | 141020000000 |
11 | 54896128250 |
12 | 233b7390368 |
13 | 103b4cb25a9 |
14 | 6b7aca43cc |
15 | 3a05553a85 |
hex | 20d5726f00 |
141020000000 has 288 divisors, whose sum is σ = 384446672064. Its totient is φ = 51200000000.
The previous prime is 141019999931. The next prime is 141020000039. The reversal of 141020000000 is 20141.
It is a Harshad number since it is a multiple of its sum of digits (8).
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, 219999680 + ... + 220000320.
It is an arithmetic number, because the mean of its divisors is an integer number (1334884278).
Almost surely, 2141020000000 is an apocalyptic number.
141020000000 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 141020000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (192223336032).
141020000000 is an abundant number, since it is smaller than the sum of its proper divisors (243426672064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141020000000 is an frugal number, since it uses more digits than its factorization.
141020000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 703 (or 659 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 141020000000 its reverse (20141), we get a palindrome (141020020141).
The spelling of 141020000000 in words is "one hundred forty-one billion, twenty million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •