Base | Representation |
---|---|
bin | 11110111011010010001… |
… | …100110000110011111010 |
3 | 21112011121122202122000120 |
4 | 132323102030300303322 |
5 | 234304443020431432 |
6 | 4304153313314110 |
7 | 306354303245613 |
oct | 36732214606372 |
9 | 7464548678016 |
10 | 2125240405242 |
11 | 74a344892a29 |
12 | 2a3a76865936 |
13 | 125542340736 |
14 | 74c0db96c0a |
15 | 3a438075c2c |
hex | 1eed2330cfa |
2125240405242 has 8 divisors (see below), whose sum is σ = 4250480810496. Its totient is φ = 708413468412.
The previous prime is 2125240405241. The next prime is 2125240405243. The reversal of 2125240405242 is 2425040425212.
It is an interprime number because it is at equal distance from previous prime (2125240405241) and next prime (2125240405243).
It is a sphenic number, since it is the product of 3 distinct primes.
2125240405242 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (2125240405241) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 177103367098 + ... + 177103367109.
It is an arithmetic number, because the mean of its divisors is an integer number (531310101312).
Almost surely, 22125240405242 is an apocalyptic number.
2125240405242 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2125240405242 is a wasteful number, since it uses less digits than its factorization.
2125240405242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354206734212.
The product of its (nonzero) digits is 51200, while the sum is 33.
The spelling of 2125240405242 in words is "two trillion, one hundred twenty-five billion, two hundred forty million, four hundred five thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •