Base | Representation |
---|---|
bin | 1010111010100011111111… |
… | …1000001111011101010101 |
3 | 1120111022012222112101120002 |
4 | 2232220333320033131111 |
5 | 3033111434321124023 |
6 | 41305140243421045 |
7 | 2346026115455126 |
oct | 256507770173525 |
9 | 46438188471502 |
10 | 12001210333013 |
11 | 39077593a8a20 |
12 | 1419ab9084785 |
13 | 69092b391375 |
14 | 2d6c0c63c04d |
15 | 15c2a42ecb28 |
hex | aea3fe0f755 |
12001210333013 has 4 divisors (see below), whose sum is σ = 13092229454208. Its totient is φ = 10910191211820.
The previous prime is 12001210332997. The next prime is 12001210333067. The reversal of 12001210333013 is 31033301210021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12001210333013 - 24 = 12001210332997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001210333093) 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, 545509560581 + ... + 545509560602.
It is an arithmetic number, because the mean of its divisors is an integer number (3273057363552).
Almost surely, 212001210333013 is an apocalyptic number.
It is an amenable number.
12001210333013 is a deficient number, since it is larger than the sum of its proper divisors (1091019121195).
12001210333013 is a wasteful number, since it uses less digits than its factorization.
12001210333013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1091019121194.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 12001210333013 its reverse (31033301210021), we get a palindrome (43034511543034).
The spelling of 12001210333013 in words is "twelve trillion, one billion, two hundred ten million, three hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •