Base | Representation |
---|---|
bin | 111000011111000011… |
… | …1000100000010001101 |
3 | 102121002200110112000002 |
4 | 1300332013010002031 |
5 | 3441411041420323 |
6 | 131420332014045 |
7 | 11522645351354 |
oct | 1607607040215 |
9 | 377080415002 |
10 | 121301123213 |
11 | 4749735a266 |
12 | 1b613601325 |
13 | b59192666a |
14 | 5c2a07a99b |
15 | 324e318828 |
hex | 1c3e1c408d |
121301123213 has 8 divisors (see below), whose sum is σ = 128683011960. Its totient is φ = 113946626560.
The previous prime is 121301123147. The next prime is 121301123231. The reversal of 121301123213 is 312321103121.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 4885730404 + 116415392809 = 69898^2 + 341197^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 121301123213 - 216 = 121301057677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121301123243) 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, 6838898 + ... + 6856611.
It is an arithmetic number, because the mean of its divisors is an integer number (16085376495).
Almost surely, 2121301123213 is an apocalyptic number.
It is an amenable number.
121301123213 is a deficient number, since it is larger than the sum of its proper divisors (7381888747).
121301123213 is a wasteful number, since it uses less digits than its factorization.
121301123213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13696047.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 121301123213 its reverse (312321103121), we get a palindrome (433622226334).
The spelling of 121301123213 in words is "one hundred twenty-one billion, three hundred one million, one hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •