Base | Representation |
---|---|
bin | 111000011100111111… |
… | …1011000011111101001 |
3 | 102120220212101202011011 |
4 | 1300321333120133221 |
5 | 3441240343013001 |
6 | 131405422303521 |
7 | 11521146002026 |
oct | 1607177303751 |
9 | 376825352134 |
10 | 121232001001 |
11 | 47461338771 |
12 | 1b5b4427ba1 |
13 | b580504547 |
14 | 5c20c0654d |
15 | 3248212d51 |
hex | 1c39fd87e9 |
121232001001 has 8 divisors (see below), whose sum is σ = 121542337224. Its totient is φ = 120921870720.
The previous prime is 121232000963. The next prime is 121232001047. The reversal of 121232001001 is 100100232121.
It can be written as a sum of positive squares in 4 ways, for example, as 7801128976 + 113430872025 = 88324^2 + 336795^2 .
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 121232001001 - 227 = 121097783273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121232001701) 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 in 7 ways as a sum of consecutive naturals, for example, 1163875 + ... + 1263751.
It is an arithmetic number, because the mean of its divisors is an integer number (15192792153).
Almost surely, 2121232001001 is an apocalyptic number.
It is an amenable number.
121232001001 is a deficient number, since it is larger than the sum of its proper divisors (310336223).
121232001001 is an equidigital number, since it uses as much as digits as its factorization.
121232001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102971.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 121232001001 its reverse (100100232121), we get a palindrome (221332233122).
The spelling of 121232001001 in words is "one hundred twenty-one billion, two hundred thirty-two million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •