Base | Representation |
---|---|
bin | 100011110010111… |
… | …0101100011100101 |
3 | 10002201002020212022 |
4 | 1013211311203211 |
5 | 4424440213104 |
6 | 315103432525 |
7 | 41523122162 |
oct | 10745654345 |
9 | 3081066768 |
10 | 1201101029 |
11 | 566a98a87 |
12 | 2962b5745 |
13 | 161abb68b |
14 | b5739069 |
15 | 706a6bbe |
hex | 479758e5 |
1201101029 has 2 divisors, whose sum is σ = 1201101030. Its totient is φ = 1201101028.
The previous prime is 1201101019. The next prime is 1201101089. The reversal of 1201101029 is 9201011021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 892396129 + 308704900 = 29873^2 + 17570^2 .
It is an emirp because it is prime and its reverse (9201011021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1201101029 - 28 = 1201100773 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1201100998 and 1201101016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1201101019) 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 as a sum of consecutive naturals, namely, 600550514 + 600550515.
It is an arithmetic number, because the mean of its divisors is an integer number (600550515).
Almost surely, 21201101029 is an apocalyptic number.
It is an amenable number.
1201101029 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201101029 is an equidigital number, since it uses as much as digits as its factorization.
1201101029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
The square root of 1201101029 is about 34656.9044924673. The cubic root of 1201101029 is about 1062.9834748060.
The spelling of 1201101029 in words is "one billion, two hundred one million, one hundred one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •