Base | Representation |
---|---|
bin | 111000011001001001… |
… | …1011001100000011101 |
3 | 102120120212201100121120 |
4 | 1300302103121200131 |
5 | 3441004333432201 |
6 | 131344534121153 |
7 | 11515021526121 |
oct | 1606223314035 |
9 | 376525640546 |
10 | 121103030301 |
11 | 473a555a110 |
12 | 1b5791b01b9 |
13 | b55c889416 |
14 | 5c0ba33581 |
15 | 323bc39536 |
hex | 1c324d981d |
121103030301 has 32 divisors (see below), whose sum is σ = 181448112768. Its totient is φ = 71199959040.
The previous prime is 121103030249. The next prime is 121103030311. The reversal of 121103030301 is 103030301121.
It is not a de Polignac number, because 121103030301 - 213 = 121103022109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121103030311) 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 31 ways as a sum of consecutive naturals, for example, 264321 + ... + 558633.
It is an arithmetic number, because the mean of its divisors is an integer number (5670253524).
Almost surely, 2121103030301 is an apocalyptic number.
121103030301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121103030301 is a deficient number, since it is larger than the sum of its proper divisors (60345082467).
121103030301 is a wasteful number, since it uses less digits than its factorization.
121103030301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294701.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 121103030301 its reverse (103030301121), we get a palindrome (224133331422).
It can be divided in two parts, 121 and 103030301, that multiplied together give a palindrome (12466666421).
The spelling of 121103030301 in words is "one hundred twenty-one billion, one hundred three million, thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •