Base | Representation |
---|---|
bin | 1011000110111010001000… |
… | …1001000010111110011001 |
3 | 1121020120200201210211221011 |
4 | 2301232202021002332121 |
5 | 3100100330422144001 |
6 | 41550415045013521 |
7 | 2400245156454355 |
oct | 261564211027631 |
9 | 47216621724834 |
10 | 12213312303001 |
11 | 3989700438307 |
12 | 14530316b42a1 |
13 | 6a79309c8414 |
14 | 3031adac2465 |
15 | 162a69e35d51 |
hex | b1ba2242f99 |
12213312303001 has 4 divisors (see below), whose sum is σ = 12213324646452. Its totient is φ = 12213299959552.
The previous prime is 12213312302957. The next prime is 12213312303013. The reversal of 12213312303001 is 10030321331221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7423167253401 + 4790145049600 = 2724549^2 + 2188640^2 .
It is a cyclic number.
It is not a de Polignac number, because 12213312303001 - 239 = 11663556489113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12213312303301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4544536 + ... + 6714121.
It is an arithmetic number, because the mean of its divisors is an integer number (3053331161613).
Almost surely, 212213312303001 is an apocalyptic number.
It is an amenable number.
12213312303001 is a deficient number, since it is larger than the sum of its proper divisors (12343451).
12213312303001 is a wasteful number, since it uses less digits than its factorization.
12213312303001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12343450.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12213312303001 its reverse (10030321331221), we get a palindrome (22243633634222).
The spelling of 12213312303001 in words is "twelve trillion, two hundred thirteen billion, three hundred twelve million, three hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •