Base | Representation |
---|---|
bin | 1011000111111000110010… |
… | …0100010100100001101101 |
3 | 1121022012002210200201022221 |
4 | 2301332030210110201231 |
5 | 3100334301314120323 |
6 | 42002235543235341 |
7 | 2401412012435620 |
oct | 261761444244155 |
9 | 47265083621287 |
10 | 12230130223213 |
11 | 3995850743721 |
12 | 1456345a48b51 |
13 | 6a93b106a0b6 |
14 | 303d27525db7 |
15 | 16320164355d |
hex | b1f8c91486d |
12230130223213 has 4 divisors (see below), whose sum is σ = 13977291683680. Its totient is φ = 10482968762748.
The previous prime is 12230130223139. The next prime is 12230130223261. The reversal of 12230130223213 is 31232203103221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12230130223213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12230130223813) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 873580730223 + ... + 873580730236.
It is an arithmetic number, because the mean of its divisors is an integer number (3494322920920).
Almost surely, 212230130223213 is an apocalyptic number.
It is an amenable number.
12230130223213 is a deficient number, since it is larger than the sum of its proper divisors (1747161460467).
12230130223213 is an equidigital number, since it uses as much as digits as its factorization.
12230130223213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1747161460466.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 12230130223213 its reverse (31232203103221), we get a palindrome (43462333326434).
The spelling of 12230130223213 in words is "twelve trillion, two hundred thirty billion, one hundred thirty million, two hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •