Base | Representation |
---|---|
bin | 110000011011100101110111… |
… | …110000100000000001010110 |
3 | 1000221011211020001222022210200 |
4 | 300123211313300200001112 |
5 | 210404312224003011202 |
6 | 2033003525505201330 |
7 | 62602624053403014 |
oct | 6033456760400126 |
9 | 1027154201868720 |
10 | 213002322313302 |
11 | 61961860a94435 |
12 | 1ba8133a930246 |
13 | 91b1057102782 |
14 | 3a855202458b4 |
15 | 1995a2c553e1c |
hex | c1b977c20056 |
213002322313302 has 24 divisors (see below), whose sum is σ = 461547221065320. Its totient is φ = 70994283429600.
The previous prime is 213002322313289. The next prime is 213002322313327. The reversal of 213002322313302 is 203313223200312.
213002322313302 is a `hidden beast` number, since 2 + 1 + 3 + 0 + 0 + 2 + 322 + 3 + 1 + 330 + 2 = 666.
It is a super-2 number, since 2×2130023223133022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 540687199 + ... + 541081002.
It is an arithmetic number, because the mean of its divisors is an integer number (19231134211055).
Almost surely, 2213002322313302 is an apocalyptic number.
213002322313302 is an abundant number, since it is smaller than the sum of its proper divisors (248544898752018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213002322313302 is a wasteful number, since it uses less digits than its factorization.
213002322313302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1081779148 (or 1081779145 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 27.
Adding to 213002322313302 its reverse (203313223200312), we get a palindrome (416315545513614).
The spelling of 213002322313302 in words is "two hundred thirteen trillion, two billion, three hundred twenty-two million, three hundred thirteen thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •