Base | Representation |
---|---|
bin | 111111010101100… |
… | …0010011010110001 |
3 | 12111002221220212010 |
4 | 1332223002122301 |
5 | 13323023230223 |
6 | 550514353133 |
7 | 103443666231 |
oct | 17653023261 |
9 | 5432856763 |
10 | 2125211313 |
11 | 9a0698795 |
12 | 4b388b7a9 |
13 | 27b3a72b4 |
14 | 16236dcc1 |
15 | c6897393 |
hex | 7eac26b1 |
2125211313 has 8 divisors (see below), whose sum is σ = 2982752800. Its totient is φ = 1342238688.
The previous prime is 2125211303. The next prime is 2125211357. The reversal of 2125211313 is 3131125212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2125211313 - 25 = 2125211281 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2125211313.
It is not an unprimeable number, because it can be changed into a prime (2125211303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18642148 + ... + 18642261.
It is an arithmetic number, because the mean of its divisors is an integer number (372844100).
Almost surely, 22125211313 is an apocalyptic number.
It is an amenable number.
2125211313 is a deficient number, since it is larger than the sum of its proper divisors (857541487).
2125211313 is a wasteful number, since it uses less digits than its factorization.
2125211313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37284431.
The product of its digits is 360, while the sum is 21.
The square root of 2125211313 is about 46100.0142407787. The cubic root of 2125211313 is about 1285.6834092285.
Adding to 2125211313 its reverse (3131125212), we get a palindrome (5256336525).
The spelling of 2125211313 in words is "two billion, one hundred twenty-five million, two hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •