Base | Representation |
---|---|
bin | 1011000110101110101010… |
… | …1000011110111001111111 |
3 | 1121020021202011120021202102 |
4 | 2301223222220132321333 |
5 | 3100023024241124002 |
6 | 41545145344215315 |
7 | 2400105653412554 |
oct | 261535250367177 |
9 | 47207664507672 |
10 | 12210233536127 |
11 | 3988370569180 |
12 | 145251260a53b |
13 | 6a755cbc5b83 |
14 | 302d9ac54a2b |
15 | 1629399d3a02 |
hex | b1aeaa1ee7f |
12210233536127 has 8 divisors (see below), whose sum is σ = 13320286589520. Its totient is φ = 11100185786560.
The previous prime is 12210233536097. The next prime is 12210233536147. The reversal of 12210233536127 is 72163533201221.
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 12210233536127 - 26 = 12210233536063 is a prime.
It is a super-2 number, since 2×122102335361272 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12210233536147) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4664273 + ... + 6795285.
It is an arithmetic number, because the mean of its divisors is an integer number (1665035823690).
Almost surely, 212210233536127 is an apocalyptic number.
12210233536127 is a deficient number, since it is larger than the sum of its proper divisors (1110053053393).
12210233536127 is a wasteful number, since it uses less digits than its factorization.
12210233536127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2651913.
The product of its (nonzero) digits is 90720, while the sum is 38.
Adding to 12210233536127 its reverse (72163533201221), we get a palindrome (84373766737348).
The spelling of 12210233536127 in words is "twelve trillion, two hundred ten billion, two hundred thirty-three million, five hundred thirty-six thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •