Base | Representation |
---|---|
bin | 1011000111111001011101… |
… | …1101100110010010001001 |
3 | 1121022012120112122021002112 |
4 | 2301332113131212102021 |
5 | 3100340140112312223 |
6 | 42002310033112105 |
7 | 2401416362212616 |
oct | 261762735462211 |
9 | 47265515567075 |
10 | 12230313010313 |
11 | 399593493a342 |
12 | 14563970b8635 |
13 | 6a940cba8748 |
14 | 303d4390750d |
15 | 1632126ec778 |
hex | b1f97766489 |
12230313010313 has 4 divisors (see below), whose sum is σ = 12230324855700. Its totient is φ = 12230301164928.
The previous prime is 12230313010301. The next prime is 12230313010367. The reversal of 12230313010313 is 31301031303221.
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 3670258987264 + 8560054023049 = 1915792^2 + 2925757^2 .
It is a cyclic number.
It is not a de Polignac number, because 12230313010313 - 28 = 12230313010057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12230313010373) 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, 4208588 + ... + 6494061.
It is an arithmetic number, because the mean of its divisors is an integer number (3057581213925).
Almost surely, 212230313010313 is an apocalyptic number.
It is an amenable number.
12230313010313 is a deficient number, since it is larger than the sum of its proper divisors (11845387).
12230313010313 is a wasteful number, since it uses less digits than its factorization.
12230313010313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11845386.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 12230313010313 its reverse (31301031303221), we get a palindrome (43531344313534).
The spelling of 12230313010313 in words is "twelve trillion, two hundred thirty billion, three hundred thirteen million, ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •