Base | Representation |
---|---|
bin | 1011111011110111110001… |
… | …1010001100010000010001 |
3 | 1201110120022020020102010011 |
4 | 2332331330122030100101 |
5 | 3210002314324030001 |
6 | 43524415344234521 |
7 | 2523056302206364 |
oct | 276757432142021 |
9 | 51416266212104 |
10 | 13123212330001 |
11 | 41aa5832699a4 |
12 | 157b44930ba41 |
13 | 74268a53a567 |
14 | 335249c460db |
15 | 17b571673d51 |
hex | bef7c68c411 |
13123212330001 has 8 divisors (see below), whose sum is σ = 13138878608640. Its totient is φ = 13107546957648.
The previous prime is 13123212329989. The next prime is 13123212330023. The reversal of 13123212330001 is 10003321232131.
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 13123212330001 - 27 = 13123212329873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13123212330071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31375095 + ... + 31790611.
It is an arithmetic number, because the mean of its divisors is an integer number (1642359826080).
Almost surely, 213123212330001 is an apocalyptic number.
It is an amenable number.
13123212330001 is a deficient number, since it is larger than the sum of its proper divisors (15666278639).
13123212330001 is an equidigital number, since it uses as much as digits as its factorization.
13123212330001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 453143.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13123212330001 its reverse (10003321232131), we get a palindrome (23126533562132).
The spelling of 13123212330001 in words is "thirteen trillion, one hundred twenty-three billion, two hundred twelve million, three hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •