Base | Representation |
---|---|
bin | 1011000110110001101000… |
… | …1011110010111010111101 |
3 | 1121020100210202202000122111 |
4 | 2301230122023302322331 |
5 | 3100031143004303201 |
6 | 41545400443414021 |
7 | 2400134511446020 |
oct | 261543213627275 |
9 | 47210722660574 |
10 | 12211031322301 |
11 | 398873a927799 |
12 | 14526b5824311 |
13 | 6a76592821b6 |
14 | 303034ba51b7 |
15 | 162984a6eb51 |
hex | b1b1a2f2ebd |
12211031322301 has 8 divisors (see below), whose sum is σ = 13955524914240. Its totient is φ = 10466552866848.
The previous prime is 12211031322271. The next prime is 12211031322319. The reversal of 12211031322301 is 10322313011221.
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 12211031322301 - 235 = 12176671583933 is a prime.
It is a super-2 number, since 2×122110313223012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12211031322361) 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, 1999291 + ... + 5330968.
It is an arithmetic number, because the mean of its divisors is an integer number (1744440614280).
Almost surely, 212211031322301 is an apocalyptic number.
It is an amenable number.
12211031322301 is a deficient number, since it is larger than the sum of its proper divisors (1744493591939).
12211031322301 is an equidigital number, since it uses as much as digits as its factorization.
12211031322301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7568243.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 12211031322301 its reverse (10322313011221), we get a palindrome (22533344333522).
The spelling of 12211031322301 in words is "twelve trillion, two hundred eleven billion, thirty-one million, three hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •