Base | Representation |
---|---|
bin | 11111001010010111010… |
… | …011101101101110001000 |
3 | 21120201102002120010001102 |
4 | 133022113103231232020 |
5 | 240041123123203112 |
6 | 4315432124440532 |
7 | 310466454501140 |
oct | 37122723555610 |
9 | 7521362503042 |
10 | 2141432241032 |
11 | 7561a37448a7 |
12 | 2a70353a9148 |
13 | 126c22a82b66 |
14 | 759083c3920 |
15 | 3aa84811bc2 |
hex | 1f2974edb88 |
2141432241032 has 64 divisors (see below), whose sum is σ = 4601392721280. Its totient is φ = 915236854272.
The previous prime is 2141432240999. The next prime is 2141432241049. The reversal of 2141432241032 is 2301422341412.
It is a super-3 number, since 3×21414322410323 (a number of 38 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2141432240986 and 2141432241004.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53391578 + ... + 53431670.
It is an arithmetic number, because the mean of its divisors is an integer number (71896761270).
Almost surely, 22141432241032 is an apocalyptic number.
It is an amenable number.
2141432241032 is an abundant number, since it is smaller than the sum of its proper divisors (2459960480248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2141432241032 is a wasteful number, since it uses less digits than its factorization.
2141432241032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42702 (or 42698 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 2141432241032 its reverse (2301422341412), we get a palindrome (4442854582444).
The spelling of 2141432241032 in words is "two trillion, one hundred forty-one billion, four hundred thirty-two million, two hundred forty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •