Base | Representation |
---|---|
bin | 1010111011001111111101… |
… | …0100011011000010011001 |
3 | 1120112102200110122102220002 |
4 | 2232303333110123002121 |
5 | 3033310122044301241 |
6 | 41314411312342345 |
7 | 2346624432036545 |
oct | 256637724330231 |
9 | 46472613572802 |
10 | 12013012103321 |
11 | 39117651766a9 |
12 | 14202515449b5 |
13 | 691a8c43b5c8 |
14 | 2d760bbb8a25 |
15 | 15c74546389b |
hex | aecff51b099 |
12013012103321 has 8 divisors (see below), whose sum is σ = 12025140541440. Its totient is φ = 12000884107968.
The previous prime is 12013012103317. The next prime is 12013012103327. The reversal of 12013012103321 is 12330121031021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12013012103321 - 22 = 12013012103317 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12013012103293 and 12013012103302.
It is not an unprimeable number, because it can be changed into a prime (12013012103327) 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, 95637860 + ... + 95763386.
It is an arithmetic number, because the mean of its divisors is an integer number (1503142567680).
Almost surely, 212013012103321 is an apocalyptic number.
It is an amenable number.
12013012103321 is a deficient number, since it is larger than the sum of its proper divisors (12128438119).
12013012103321 is a wasteful number, since it uses less digits than its factorization.
12013012103321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221383.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12013012103321 its reverse (12330121031021), we get a palindrome (24343133134342).
The spelling of 12013012103321 in words is "twelve trillion, thirteen billion, twelve million, one hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •