Base | Representation |
---|---|
bin | 1011001011111101000100… |
… | …1000010111100000000001 |
3 | 1121112212110011000010112121 |
4 | 2302333101020113200001 |
5 | 3103010400000000001 |
6 | 42054313023124241 |
7 | 2406434315645020 |
oct | 262772110274001 |
9 | 47485404003477 |
10 | 12300000000001 |
11 | 3a124453810aa |
12 | 14679a5143681 |
13 | 6b2b6751b49c |
14 | 307474b208b7 |
15 | 164e405ce6a1 |
hex | b2fd1217801 |
12300000000001 has 8 divisors (see below), whose sum is σ = 14164449292224. Its totient is φ = 10462377316560.
The previous prime is 12299999999993. The next prime is 12300000000011. The reversal of 12300000000001 is 10000000000321.
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 12300000000001 - 23 = 12299999999993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is not an unprimeable number, because it can be changed into a prime (12300000000011) 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, 6706651210 + ... + 6706653043.
It is an arithmetic number, because the mean of its divisors is an integer number (1770556161528).
Almost surely, 212300000000001 is an apocalyptic number.
It is an amenable number.
12300000000001 is a deficient number, since it is larger than the sum of its proper divisors (1864449292223).
12300000000001 is a wasteful number, since it uses less digits than its factorization.
12300000000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13413304391.
The product of its (nonzero) digits is 6, while the sum is 7.
Adding to 12300000000001 its reverse (10000000000321), we get a palindrome (22300000000322).
The spelling of 12300000000001 in words is "twelve trillion, three hundred billion, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.258 sec. • engine limits •