Base | Representation |
---|---|
bin | 110000011011100101101010… |
… | …100000100110011011011000 |
3 | 1000221011210122120201202010012 |
4 | 300123211222200212123120 |
5 | 210404311300102311212 |
6 | 2033003451445141052 |
7 | 62602615414205042 |
oct | 6033455240463330 |
9 | 1027153576652105 |
10 | 213002100041432 |
11 | 6196175757a279 |
12 | 1ba812983ba788 |
13 | 91b102004ac60 |
14 | 3a854dc906a92 |
15 | 1995a17c9a922 |
hex | c1b96a8266d8 |
213002100041432 has 64 divisors (see below), whose sum is σ = 437666556096000. Its totient is φ = 96581358486144.
The previous prime is 213002100041407. The next prime is 213002100041461. The reversal of 213002100041432 is 234140001200312.
It is a super-2 number, since 2×2130021000414322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 213002100041398 and 213002100041407.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1251182 + ... + 20677757.
It is an arithmetic number, because the mean of its divisors is an integer number (6838539939000).
Almost surely, 2213002100041432 is an apocalyptic number.
It is an amenable number.
213002100041432 is an abundant number, since it is smaller than the sum of its proper divisors (224664456054568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213002100041432 is a wasteful number, since it uses less digits than its factorization.
213002100041432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21930600 (or 21930596 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 213002100041432 its reverse (234140001200312), we get a palindrome (447142101241744).
The spelling of 213002100041432 in words is "two hundred thirteen trillion, two billion, one hundred million, forty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •