Base | Representation |
---|---|
bin | 11110111011010011010… |
… | …111101011111110010111 |
3 | 21112011200000201111101121 |
4 | 132323103113223332113 |
5 | 234310013032434411 |
6 | 4304155254304411 |
7 | 306354632221150 |
oct | 36732327537627 |
9 | 7464600644347 |
10 | 2125260046231 |
11 | 74a354988553 |
12 | 2a3a81358107 |
13 | 12554642961a |
14 | 74c1262a927 |
15 | 3a439b55571 |
hex | 1eed35ebf97 |
2125260046231 has 4 divisors (see below), whose sum is σ = 2428868624272. Its totient is φ = 1821651468192.
The previous prime is 2125260046211. The next prime is 2125260046241. The reversal of 2125260046231 is 1326400625212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2125260046231 - 227 = 2125125828503 is a prime.
It is a super-2 number, since 2×21252600462312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2125260046211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 151804289010 + ... + 151804289023.
It is an arithmetic number, because the mean of its divisors is an integer number (607217156068).
Almost surely, 22125260046231 is an apocalyptic number.
2125260046231 is a deficient number, since it is larger than the sum of its proper divisors (303608578041).
2125260046231 is an equidigital number, since it uses as much as digits as its factorization.
2125260046231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303608578040.
The product of its (nonzero) digits is 34560, while the sum is 34.
The spelling of 2125260046231 in words is "two trillion, one hundred twenty-five billion, two hundred sixty million, forty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •