Base | Representation |
---|---|
bin | 1011000111111001000101… |
… | …0101001001010101100111 |
3 | 1121022012022101001110121211 |
4 | 2301332101111021111213 |
5 | 3100334432243200203 |
6 | 42002251520052251 |
7 | 2401414002600043 |
oct | 261762125112547 |
9 | 47265271043554 |
10 | 12230210131303 |
11 | 399589186186a |
12 | 1456368764087 |
13 | 6a93c47976a8 |
14 | 303d33da7023 |
15 | 163208679c6d |
hex | b1f91549567 |
12230210131303 has 4 divisors (see below), whose sum is σ = 12230233825968. Its totient is φ = 12230186436640.
The previous prime is 12230210131283. The next prime is 12230210131309. The reversal of 12230210131303 is 30313101203221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12230210131303 - 213 = 12230210123111 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 (12230210131309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11055451 + ... + 12111292.
It is an arithmetic number, because the mean of its divisors is an integer number (3057558456492).
Almost surely, 212230210131303 is an apocalyptic number.
12230210131303 is a deficient number, since it is larger than the sum of its proper divisors (23694665).
12230210131303 is an equidigital number, since it uses as much as digits as its factorization.
12230210131303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23694664.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12230210131303 its reverse (30313101203221), we get a palindrome (42543311334524).
The spelling of 12230210131303 in words is "twelve trillion, two hundred thirty billion, two hundred ten million, one hundred thirty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •