Base | Representation |
---|---|
bin | 11110110111100001011… |
… | …111011110010110110101 |
3 | 21111210012012210110022102 |
4 | 132313201133132112311 |
5 | 234223210203020313 |
6 | 4302244452311445 |
7 | 306152235342362 |
oct | 36674137362665 |
9 | 7453165713272 |
10 | 2121202001333 |
11 | 748662259338 |
12 | 2a312a312585 |
13 | 12504a793b1c |
14 | 749496c7469 |
15 | 3a29d766a58 |
hex | 1ede17de5b5 |
2121202001333 has 8 divisors (see below), whose sum is σ = 2219003570688. Its totient is φ = 2023865048304.
The previous prime is 2121202001329. The next prime is 2121202001357. The reversal of 2121202001333 is 3331002021212.
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 2121202001333 - 22 = 2121202001329 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 (2121202001033) 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, 116144741 + ... + 116163002.
It is an arithmetic number, because the mean of its divisors is an integer number (277375446336).
Almost surely, 22121202001333 is an apocalyptic number.
2121202001333 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2121202001333 is a deficient number, since it is larger than the sum of its proper divisors (97801569355).
2121202001333 is a wasteful number, since it uses less digits than its factorization.
2121202001333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232308163.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2121202001333 its reverse (3331002021212), we get a palindrome (5452204022545).
The spelling of 2121202001333 in words is "two trillion, one hundred twenty-one billion, two hundred two million, one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •