Base | Representation |
---|---|
bin | 1100011010001111001… |
… | …0010100100011111100 |
3 | 202101022100210221112102 |
4 | 3012203302110203330 |
5 | 11443114011301012 |
6 | 241535431124232 |
7 | 21255216636416 |
oct | 3064362244374 |
9 | 671270727472 |
10 | 213201275132 |
11 | 8246661a63a |
12 | 353a0813678 |
13 | 17149303691 |
14 | a4674819b6 |
15 | 582c3d32c2 |
hex | 31a3c948fc |
213201275132 has 12 divisors (see below), whose sum is σ = 385967825880. Its totient is φ = 102924753456.
The previous prime is 213201275123. The next prime is 213201275173. The reversal of 213201275132 is 231572102312.
213201275132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 213201275095 and 213201275104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 918970898 + ... + 918971129.
It is an arithmetic number, because the mean of its divisors is an integer number (32163985490).
Almost surely, 2213201275132 is an apocalyptic number.
It is an amenable number.
213201275132 is a deficient number, since it is larger than the sum of its proper divisors (172766550748).
213201275132 is a wasteful number, since it uses less digits than its factorization.
213201275132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1837942060 (or 1837942058 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 29.
Adding to 213201275132 its reverse (231572102312), we get a palindrome (444773377444).
The spelling of 213201275132 in words is "two hundred thirteen billion, two hundred one million, two hundred seventy-five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •