Base | Representation |
---|---|
bin | 11011100000111100010001… |
… | …101011100101011111100001 |
3 | 120212110112112200000200110001 |
4 | 123200330101223211133201 |
5 | 111330121012023000413 |
6 | 1105211404103540001 |
7 | 34326520252133440 |
oct | 3340742153453741 |
9 | 525415480020401 |
10 | 121011000203233 |
11 | 35615527956658 |
12 | 116a48ab15a601 |
13 | 526a3996914ba |
14 | 21c4d6c3dad57 |
15 | decb9199b4dd |
hex | 6e0f11ae57e1 |
121011000203233 has 8 divisors (see below), whose sum is σ = 138299137388352. Its totient is φ = 103723075878576.
The previous prime is 121011000203179. The next prime is 121011000203347. The reversal of 121011000203233 is 332302000110121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121011000203233 - 237 = 120873561249761 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121011000203233.
It is not an unprimeable number, because it can be changed into a prime (121011000203633) 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, 51995035 + ... + 54272512.
It is an arithmetic number, because the mean of its divisors is an integer number (17287392173544).
Almost surely, 2121011000203233 is an apocalyptic number.
It is an amenable number.
121011000203233 is a deficient number, since it is larger than the sum of its proper divisors (17288137185119).
121011000203233 is a wasteful number, since it uses less digits than its factorization.
121011000203233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106430231.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 121011000203233 its reverse (332302000110121), we get a palindrome (453313000313354).
The spelling of 121011000203233 in words is "one hundred twenty-one trillion, eleven billion, two hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •