Base | Representation |
---|---|
bin | 11110111000010001000… |
… | …111011010011100101001 |
3 | 21111212020220020210202021 |
4 | 132320101013122130221 |
5 | 234231324224001413 |
6 | 4302500033504441 |
7 | 306211106616262 |
oct | 36702107323451 |
9 | 7455226223667 |
10 | 2122001000233 |
11 | 748a32276004 |
12 | 2a3311a12121 |
13 | 12514718613a |
14 | 749c3871969 |
15 | 3a2e899218d |
hex | 1ee111da729 |
2122001000233 has 4 divisors (see below), whose sum is σ = 2246824588500. Its totient is φ = 1997177411968.
The previous prime is 2122001000209. The next prime is 2122001000261. The reversal of 2122001000233 is 3320001002212.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1525257110169 + 596743890064 = 1235013^2 + 772492^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2122001000233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2122001000263) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62411794108 + ... + 62411794141.
It is an arithmetic number, because the mean of its divisors is an integer number (561706147125).
Almost surely, 22122001000233 is an apocalyptic number.
It is an amenable number.
2122001000233 is a deficient number, since it is larger than the sum of its proper divisors (124823588267).
2122001000233 is a wasteful number, since it uses less digits than its factorization.
2122001000233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124823588266.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 2122001000233 its reverse (3320001002212), we get a palindrome (5442002002445).
The spelling of 2122001000233 in words is "two trillion, one hundred twenty-two billion, one million, two hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •