Base | Representation |
---|---|
bin | 1011010000001101110001… |
… | …0000000011100111100011 |
3 | 1121210212101122121200102121 |
4 | 2310003130100003213203 |
5 | 3110210303424242443 |
6 | 42152100422525111 |
7 | 2414635312156543 |
oct | 264033420034743 |
9 | 47725348550377 |
10 | 12373201009123 |
11 | 3a40499445759 |
12 | 147a013b96797 |
13 | 6b9a31b98a76 |
14 | 30ac1a905323 |
15 | 166cc6c3c4ed |
hex | b40dc4039e3 |
12373201009123 has 8 divisors (see below), whose sum is σ = 12397691824560. Its totient is φ = 12348710908320.
The previous prime is 12373201009093. The next prime is 12373201009151. The reversal of 12373201009123 is 32190010237321.
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 12373201009123 - 221 = 12373198911971 is a prime.
It is a super-2 number, since 2×123732010091232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12373201009223) 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, 46538161 + ... + 46803277.
It is an arithmetic number, because the mean of its divisors is an integer number (1549711478070).
Almost surely, 212373201009123 is an apocalyptic number.
12373201009123 is a deficient number, since it is larger than the sum of its proper divisors (24490815437).
12373201009123 is an equidigital number, since it uses as much as digits as its factorization.
12373201009123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357317.
The product of its (nonzero) digits is 13608, while the sum is 34.
The spelling of 12373201009123 in words is "twelve trillion, three hundred seventy-three billion, two hundred one million, nine thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •