Base | Representation |
---|---|
bin | 11011100100001000010000… |
… | …010110000011010111010101 |
3 | 120220020110212121111201022010 |
4 | 123210020100112003113111 |
5 | 111342213040401111201 |
6 | 1105500145230054433 |
7 | 34351402636142652 |
oct | 3344102026032725 |
9 | 526213777451263 |
10 | 121230021113301 |
11 | 3569a3aa505041 |
12 | 1171b23494a419 |
13 | 5284c3258c839 |
14 | 21d17c873ac29 |
15 | e0370ec3abd6 |
hex | 6e42105835d5 |
121230021113301 has 8 divisors (see below), whose sum is σ = 168667855462080. Its totient is φ = 77306100420032.
The previous prime is 121230021113287. The next prime is 121230021113339. The reversal of 121230021113301 is 103311120032121.
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 121230021113301 - 221 = 121230019016149 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121230021112301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 878478413796 + ... + 878478413933.
It is an arithmetic number, because the mean of its divisors is an integer number (21083481932760).
Almost surely, 2121230021113301 is an apocalyptic number.
It is an amenable number.
121230021113301 is a deficient number, since it is larger than the sum of its proper divisors (47437834348779).
121230021113301 is a wasteful number, since it uses less digits than its factorization.
121230021113301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1756956827755.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 121230021113301 its reverse (103311120032121), we get a palindrome (224541141145422).
The spelling of 121230021113301 in words is "one hundred twenty-one trillion, two hundred thirty billion, twenty-one million, one hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •