Base | Representation |
---|---|
bin | 11011100001000111100011… |
… | …011110111000000000000010 |
3 | 120212111200210121210011121201 |
4 | 123201013203132320000002 |
5 | 111330320312131133442 |
6 | 1105221125455211414 |
7 | 34330426325653111 |
oct | 3341074336700002 |
9 | 525450717704551 |
10 | 121023110021122 |
11 | 3561a6815a5011 |
12 | 116a710a816b6a |
13 | 526b5794c650a |
14 | 21c579a843c78 |
15 | ded14ebb07b7 |
hex | 6e11e37b8002 |
121023110021122 has 4 divisors (see below), whose sum is σ = 181534665031686. Its totient is φ = 60511555010560.
The previous prime is 121023110021087. The next prime is 121023110021123. The reversal of 121023110021122 is 221120011320121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 118661174435241 + 2361935585881 = 10893171^2 + 1536859^2 .
It is a super-2 number, since 2×1210231100211222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 121023110021122.
It is not an unprimeable number, because it can be changed into a prime (121023110021123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30255777505279 + ... + 30255777505282.
Almost surely, 2121023110021122 is an apocalyptic number.
121023110021122 is a deficient number, since it is larger than the sum of its proper divisors (60511555010564).
121023110021122 is an equidigital number, since it uses as much as digits as its factorization.
121023110021122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60511555010563.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 121023110021122 its reverse (221120011320121), we get a palindrome (342143121341243).
The spelling of 121023110021122 in words is "one hundred twenty-one trillion, twenty-three billion, one hundred ten million, twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •