Base | Representation |
---|---|
bin | 111111110011110… |
… | …0011101110000000 |
3 | 12112012210221121011 |
4 | 1333213203232000 |
5 | 13341103420402 |
6 | 552242410304 |
7 | 104025564052 |
oct | 17747435600 |
9 | 5465727534 |
10 | 2141076352 |
11 | 9a9644398 |
12 | 4b9060994 |
13 | 2817705ac |
14 | 1644dd8d2 |
15 | c7e7ced7 |
hex | 7f9e3b80 |
2141076352 has 64 divisors (see below), whose sum is σ = 4371148800. Its totient is φ = 1044166144.
The previous prime is 2141076337. The next prime is 2141076397. The reversal of 2141076352 is 2536701412.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2881293 + ... + 2882035.
It is an arithmetic number, because the mean of its divisors is an integer number (68299200).
Almost surely, 22141076352 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2141076352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2185574400).
2141076352 is an abundant number, since it is smaller than the sum of its proper divisors (2230072448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2141076352 is an equidigital number, since it uses as much as digits as its factorization.
2141076352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1283 (or 1271 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 31.
The square root of 2141076352 is about 46271.7662511385. The cubic root of 2141076352 is about 1288.8747577964.
Adding to 2141076352 its reverse (2536701412), we get a palindrome (4677777764).
The spelling of 2141076352 in words is "two billion, one hundred forty-one million, seventy-six thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •