Base | Representation |
---|---|
bin | 10001011111101010100… |
… | …000011000010000100101 |
3 | 11020221011111021122021101 |
4 | 101133222200120100211 |
5 | 124144131414411401 |
6 | 2320144050120101 |
7 | 152600246235313 |
oct | 21375240302045 |
9 | 4227144248241 |
10 | 1202230232101 |
11 | 423954695518 |
12 | 175000580031 |
13 | 894a6672b82 |
14 | 4228c7d50b3 |
15 | 214158ca101 |
hex | 117ea818425 |
1202230232101 has 8 divisors (see below), whose sum is σ = 1230211794240. Its totient is φ = 1174249702752.
The previous prime is 1202230232083. The next prime is 1202230232117. The reversal of 1202230232101 is 1012320322021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1202230232101 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 (1202230232171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2415465 + ... + 2870353.
It is an arithmetic number, because the mean of its divisors is an integer number (153776474280).
Almost surely, 21202230232101 is an apocalyptic number.
It is an amenable number.
1202230232101 is a deficient number, since it is larger than the sum of its proper divisors (27981562139).
1202230232101 is an equidigital number, since it uses as much as digits as its factorization.
1202230232101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 516395.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 1202230232101 its reverse (1012320322021), we get a palindrome (2214550554122).
The spelling of 1202230232101 in words is "one trillion, two hundred two billion, two hundred thirty million, two hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •