Base | Representation |
---|---|
bin | 1011000000100000011000… |
… | …1010011001101101111001 |
3 | 1120212001210021012102101010 |
4 | 2300020012022121231321 |
5 | 3041300100213331301 |
6 | 41424104454344133 |
7 | 2356302403664625 |
oct | 260100612315571 |
9 | 46761707172333 |
10 | 12103321230201 |
11 | 3946a98335353 |
12 | 143585595b049 |
13 | 69a4523059a6 |
14 | 2dbb37b84185 |
15 | 15ec7da035d6 |
hex | b0206299b79 |
12103321230201 has 8 divisors (see below), whose sum is σ = 16481118271104. Its totient is φ = 7897202504720.
The previous prime is 12103321230179. The next prime is 12103321230233. The reversal of 12103321230201 is 10203212330121.
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 12103321230201 - 226 = 12103254121337 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12103321230281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42919578690 + ... + 42919578971.
It is an arithmetic number, because the mean of its divisors is an integer number (2060139783888).
Almost surely, 212103321230201 is an apocalyptic number.
It is an amenable number.
12103321230201 is a deficient number, since it is larger than the sum of its proper divisors (4377797040903).
12103321230201 is an equidigital number, since it uses as much as digits as its factorization.
12103321230201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85839157711.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 12103321230201 its reverse (10203212330121), we get a palindrome (22306533560322).
The spelling of 12103321230201 in words is "twelve trillion, one hundred three billion, three hundred twenty-one million, two hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •