Base | Representation |
---|---|
bin | 10001111011011110111… |
… | …100011011100001001001 |
3 | 11100210021020110101122001 |
4 | 101323132330123201021 |
5 | 130141320330424321 |
6 | 2342004105031001 |
7 | 155005416645454 |
oct | 21733674334111 |
9 | 4323236411561 |
10 | 1232101029961 |
11 | 435592a0201a |
12 | 17a958185461 |
13 | 8c25703b6a9 |
14 | 438c3a0a49b |
15 | 220b2ed1c91 |
hex | 11edef1b849 |
1232101029961 has 2 divisors, whose sum is σ = 1232101029962. Its totient is φ = 1232101029960.
The previous prime is 1232101029959. The next prime is 1232101030067. The reversal of 1232101029961 is 1699201012321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1225351585936 + 6749444025 = 1106956^2 + 82155^2 .
It is a cyclic number.
It is not a de Polignac number, because 1232101029961 - 21 = 1232101029959 is a prime.
Together with 1232101029959, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1232101029961.
It is not a weakly prime, because it can be changed into another prime (1232101029911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 616050514980 + 616050514981.
It is an arithmetic number, because the mean of its divisors is an integer number (616050514981).
Almost surely, 21232101029961 is an apocalyptic number.
It is an amenable number.
1232101029961 is a deficient number, since it is larger than the sum of its proper divisors (1).
1232101029961 is an equidigital number, since it uses as much as digits as its factorization.
1232101029961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 37.
The spelling of 1232101029961 in words is "one trillion, two hundred thirty-two billion, one hundred one million, twenty-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •