Base | Representation |
---|---|
bin | 1010111100010111110100… |
… | …1010011111111000000101 |
3 | 1120121021110220102202220201 |
4 | 2233011331022133320011 |
5 | 3034114124121100401 |
6 | 41331321441530501 |
7 | 2351206456356010 |
oct | 257057512377005 |
9 | 46537426382821 |
10 | 12032303300101 |
11 | 3919964593337 |
12 | 1423b36043a31 |
13 | 693845013c46 |
14 | 2d851bcb4377 |
15 | 15cec3d6db01 |
hex | af17d29fe05 |
12032303300101 has 8 divisors (see below), whose sum is σ = 13751224809920. Its totient is φ = 10313387049888.
The previous prime is 12032303300057. The next prime is 12032303300117. The reversal of 12032303300101 is 10100330323021.
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 12032303300101 - 213 = 12032303291909 is a prime.
It is a super-2 number, since 2×120323033001012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12032303300131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7794730 + ... + 9209908.
It is an arithmetic number, because the mean of its divisors is an integer number (1718903101240).
Almost surely, 212032303300101 is an apocalyptic number.
It is an amenable number.
12032303300101 is a deficient number, since it is larger than the sum of its proper divisors (1718921509819).
12032303300101 is a wasteful number, since it uses less digits than its factorization.
12032303300101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2629803.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 12032303300101 its reverse (10100330323021), we get a palindrome (22132633623122).
The spelling of 12032303300101 in words is "twelve trillion, thirty-two billion, three hundred three million, three hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •