Base | Representation |
---|---|
bin | 11110111111110101101… |
… | …010001111100011101101 |
3 | 21112122020102222011222211 |
4 | 132333311222033203231 |
5 | 234400001324200323 |
6 | 4310322433010421 |
7 | 306616420555123 |
oct | 36776552174355 |
9 | 7478212864884 |
10 | 2130130303213 |
11 | 751424029720 |
12 | 2a4a003b3a11 |
13 | 125b4142c6a3 |
14 | 75155397913 |
15 | 3a6224ce70d |
hex | 1eff5a8f8ed |
2130130303213 has 8 divisors (see below), whose sum is σ = 2325578511456. Its totient is φ = 1934982094800.
The previous prime is 2130130303183. The next prime is 2130130303271. The reversal of 2130130303213 is 3123030310312.
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 2130130303213 - 213 = 2130130295021 is a prime.
It is a super-3 number, since 3×21301303032133 (a number of 38 digits) contains 333 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 (2130130303283) 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, 74985106 + ... + 75013507.
It is an arithmetic number, because the mean of its divisors is an integer number (290697313932).
Almost surely, 22130130303213 is an apocalyptic number.
It is an amenable number.
2130130303213 is a deficient number, since it is larger than the sum of its proper divisors (195448208243).
2130130303213 is a wasteful number, since it uses less digits than its factorization.
2130130303213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 149999915.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 2130130303213 its reverse (3123030310312), we get a palindrome (5253160613525).
The spelling of 2130130303213 in words is "two trillion, one hundred thirty billion, one hundred thirty million, three hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •