Base | Representation |
---|---|
bin | 1011001100001000010100… |
… | …1101000100000111110111 |
3 | 1121120011020200210110002211 |
4 | 2303002011031010013313 |
5 | 3103033041402131411 |
6 | 42055532504314251 |
7 | 2406602222064616 |
oct | 263020515040767 |
9 | 47504220713084 |
10 | 12303021130231 |
11 | 3a13755763a47 |
12 | 14684a8a72987 |
13 | 6b32293c0700 |
14 | 30768006787d |
15 | 16506a949221 |
hex | b30853441f7 |
12303021130231 has 12 divisors (see below), whose sum is σ = 13781592742680. Its totient is φ = 10965026785440.
The previous prime is 12303021130199. The next prime is 12303021130243. The reversal of 12303021130231 is 13203112030321.
It is not a de Polignac number, because 12303021130231 - 25 = 12303021130199 is a prime.
It is a super-4 number, since 4×123030211302314 (a number of 53 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12303021130291) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1255149265 + ... + 1255159066.
It is an arithmetic number, because the mean of its divisors is an integer number (1148466061890).
Almost surely, 212303021130231 is an apocalyptic number.
12303021130231 is a deficient number, since it is larger than the sum of its proper divisors (1478571612449).
12303021130231 is a wasteful number, since it uses less digits than its factorization.
12303021130231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2510308386 (or 2510308373 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12303021130231 its reverse (13203112030321), we get a palindrome (25506133160552).
The spelling of 12303021130231 in words is "twelve trillion, three hundred three billion, twenty-one million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •