Base | Representation |
---|---|
bin | 1011001100001000100111… |
… | …1010010100000110010101 |
3 | 1121120011110012101120122121 |
4 | 2303002021322110012111 |
5 | 3103033222111213023 |
6 | 42055544405055541 |
7 | 2406604201243261 |
oct | 263021172240625 |
9 | 47504405346577 |
10 | 12303100101013 |
11 | 3a137962a1957 |
12 | 146850b3b75b1 |
13 | 6b323c880497 |
14 | 30768a7430a1 |
15 | 165072847d5d |
hex | b3089e94195 |
12303100101013 has 8 divisors (see below), whose sum is σ = 12335210873568. Its totient is φ = 12271008872304.
The previous prime is 12303100101011. The next prime is 12303100101109. The reversal of 12303100101013 is 31010100130321.
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 12303100101013 - 21 = 12303100101011 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 (12303100101011) 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, 3624870 + ... + 6143767.
It is an arithmetic number, because the mean of its divisors is an integer number (1541901359196).
Almost surely, 212303100101013 is an apocalyptic number.
It is an amenable number.
12303100101013 is a deficient number, since it is larger than the sum of its proper divisors (32110772555).
12303100101013 is an equidigital number, since it uses as much as digits as its factorization.
12303100101013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9771923.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 12303100101013 its reverse (31010100130321), we get a palindrome (43313200231334).
The spelling of 12303100101013 in words is "twelve trillion, three hundred three billion, one hundred million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •