Base | Representation |
---|---|
bin | 111000010110010001… |
… | …0100101110011100111 |
3 | 102120100010210110112202 |
4 | 1300230202211303213 |
5 | 3440310111141133 |
6 | 131331202005115 |
7 | 11512436000042 |
oct | 1605442456347 |
9 | 376303713482 |
10 | 121006349543 |
11 | 47355a25462 |
12 | 1b55094679b |
13 | b545838681 |
14 | 5bdcc67c59 |
15 | 32334dd2e8 |
hex | 1c2c8a5ce7 |
121006349543 has 8 divisors (see below), whose sum is σ = 123087762000. Its totient is φ = 118925952448.
The previous prime is 121006349533. The next prime is 121006349551. The reversal of 121006349543 is 345943600121.
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 121006349543 - 220 = 121005300967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121006349497 and 121006349506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121006349533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11468 + ... + 492081.
It is an arithmetic number, because the mean of its divisors is an integer number (15385970250).
Almost surely, 2121006349543 is an apocalyptic number.
121006349543 is a deficient number, since it is larger than the sum of its proper divisors (2081412457).
121006349543 is an equidigital number, since it uses as much as digits as its factorization.
121006349543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 507681.
The product of its (nonzero) digits is 77760, while the sum is 38.
Adding to 121006349543 its reverse (345943600121), we get a palindrome (466949949664).
The spelling of 121006349543 in words is "one hundred twenty-one billion, six million, three hundred forty-nine thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •