Base | Representation |
---|---|
bin | 1011000111111000110000… |
… | …0001001011010010001001 |
3 | 1121022012002011100122121102 |
4 | 2301332030001023102021 |
5 | 3100334241434312223 |
6 | 42002235013551145 |
7 | 2401411541225063 |
oct | 261761401132211 |
9 | 47265064318542 |
10 | 12230121010313 |
11 | 3995846520958 |
12 | 14563429454b5 |
13 | 6a93ac19288b |
14 | 303d26208733 |
15 | 163200923928 |
hex | b1f8c04b489 |
12230121010313 has 8 divisors (see below), whose sum is σ = 12239995025088. Its totient is φ = 12220247462544.
The previous prime is 12230121010307. The next prime is 12230121010343. The reversal of 12230121010313 is 31301012103221.
It is a happy number.
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 12230121010313 - 210 = 12230121009289 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12230121010343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 68387270 + ... + 68565872.
It is an arithmetic number, because the mean of its divisors is an integer number (1529999378136).
Almost surely, 212230121010313 is an apocalyptic number.
It is an amenable number.
12230121010313 is a deficient number, since it is larger than the sum of its proper divisors (9874014775).
12230121010313 is a wasteful number, since it uses less digits than its factorization.
12230121010313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233503.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12230121010313 its reverse (31301012103221), we get a palindrome (43531133113534).
The spelling of 12230121010313 in words is "twelve trillion, two hundred thirty billion, one hundred twenty-one million, ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •