Base | Representation |
---|---|
bin | 10001111011011001100… |
… | …101110000011001100101 |
3 | 11100210000222102120020012 |
4 | 101323121211300121211 |
5 | 130141124331400401 |
6 | 2341551135420005 |
7 | 155003246262023 |
oct | 21733145603145 |
9 | 4323028376205 |
10 | 1232011200101 |
11 | 435547227570 |
12 | 17a932084605 |
13 | 8c241549026 |
14 | 438b5b05713 |
15 | 220aa18a8bb |
hex | 11ed9970665 |
1232011200101 has 8 divisors (see below), whose sum is σ = 1376793004608. Its totient is φ = 1092692860000.
The previous prime is 1232011200047. The next prime is 1232011200109. The reversal of 1232011200101 is 1010021102321.
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 1232011200101 - 210 = 1232011199077 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 (1232011200109) 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, 1365865625 + ... + 1365866526.
It is an arithmetic number, because the mean of its divisors is an integer number (172099125576).
Almost surely, 21232011200101 is an apocalyptic number.
1232011200101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1232011200101 is a deficient number, since it is larger than the sum of its proper divisors (144781804507).
1232011200101 is a wasteful number, since it uses less digits than its factorization.
1232011200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2731732203.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1232011200101 its reverse (1010021102321), we get a palindrome (2242032302422).
The spelling of 1232011200101 in words is "one trillion, two hundred thirty-two billion, eleven million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •