Base | Representation |
---|---|
bin | 11101011010100000110… |
… | …010000010110100100001 |
3 | 21011020102002221221012222 |
4 | 131122200302002310201 |
5 | 231104142004234213 |
6 | 4144330454000425 |
7 | 266015331245360 |
oct | 35324062026441 |
9 | 7136362857188 |
10 | 2021332102433 |
11 | 70a273304106 |
12 | 2878b8046115 |
13 | 1187c2c06ba7 |
14 | 6db93a517d7 |
15 | 378a5b7a808 |
hex | 1d6a0c82d21 |
2021332102433 has 8 divisors (see below), whose sum is σ = 2332966048320. Its totient is φ = 1715416210800.
The previous prime is 2021332102399. The next prime is 2021332102453. The reversal of 2021332102433 is 3342012331202.
It is a happy number.
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 2021332102433 - 210 = 2021332101409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2021332102453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1429512803 + ... + 1429514216.
It is an arithmetic number, because the mean of its divisors is an integer number (291620756040).
Almost surely, 22021332102433 is an apocalyptic number.
It is an amenable number.
2021332102433 is a deficient number, since it is larger than the sum of its proper divisors (311633945887).
2021332102433 is a wasteful number, since it uses less digits than its factorization.
2021332102433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2859027127.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 2021332102433 its reverse (3342012331202), we get a palindrome (5363344433635).
The spelling of 2021332102433 in words is "two trillion, twenty-one billion, three hundred thirty-two million, one hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •