Base | Representation |
---|---|
bin | 1011000001100010101100… |
… | …0011110100110001111111 |
3 | 1120220202201200222022211112 |
4 | 2300120223003310301333 |
5 | 3042043023223212343 |
6 | 41440210554512235 |
7 | 2360502441110354 |
oct | 260305303646177 |
9 | 46822650868745 |
10 | 12121120132223 |
11 | 39535a1354933 |
12 | 14391a273567b |
13 | 69c02a98628b |
14 | 2dc9459c462b |
15 | 1604713d7218 |
hex | b062b0f4c7f |
12121120132223 has 8 divisors (see below), whose sum is σ = 12512917071360. Its totient is φ = 11729372759640.
The previous prime is 12121120132213. The next prime is 12121120132279. The reversal of 12121120132223 is 32223102112121.
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 12121120132223 - 26 = 12121120132159 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 (12121120132213) 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 7 ways as a sum of consecutive naturals, for example, 11894333 + ... + 12873126.
It is an arithmetic number, because the mean of its divisors is an integer number (1564114633920).
Almost surely, 212121120132223 is an apocalyptic number.
12121120132223 is a deficient number, since it is larger than the sum of its proper divisors (391796939137).
12121120132223 is a wasteful number, since it uses less digits than its factorization.
12121120132223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24783277.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 12121120132223 its reverse (32223102112121), we get a palindrome (44344222244344).
The spelling of 12121120132223 in words is "twelve trillion, one hundred twenty-one billion, one hundred twenty million, one hundred thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •