Base | Representation |
---|---|
bin | 11110111111111111111… |
… | …111010100101001011001 |
3 | 21112122200112001122012022 |
4 | 132333333333110221121 |
5 | 234400330210214431 |
6 | 4310351543224225 |
7 | 306623623561154 |
oct | 36777777245131 |
9 | 7478615048168 |
10 | 2130303601241 |
11 | 751502934032 |
12 | 2a4a4a448075 |
13 | 125b6b2c7bba |
14 | 751703c8c9b |
15 | 3a63281207b |
hex | 1effffd4a59 |
2130303601241 has 8 divisors (see below), whose sum is σ = 2166480056160. Its totient is φ = 2094129466912.
The previous prime is 2130303601199. The next prime is 2130303601243. The reversal of 2130303601241 is 1421063030312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2130303601241 - 218 = 2130303339097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2130303601241.
It is not an unprimeable number, because it can be changed into a prime (2130303601243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1324061 + ... + 2452293.
It is an arithmetic number, because the mean of its divisors is an integer number (270810007020).
Almost surely, 22130303601241 is an apocalyptic number.
It is an amenable number.
2130303601241 is a deficient number, since it is larger than the sum of its proper divisors (36176454919).
2130303601241 is a wasteful number, since it uses less digits than its factorization.
2130303601241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1160295.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 2130303601241 its reverse (1421063030312), we get a palindrome (3551366631553).
The spelling of 2130303601241 in words is "two trillion, one hundred thirty billion, three hundred three million, six hundred one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •