Base | Representation |
---|---|
bin | 1100011010011001001… |
… | …0010111101100111000 |
3 | 202101102021202112012122 |
4 | 3012212102113230320 |
5 | 11443210231343112 |
6 | 241543530300412 |
7 | 21256236362006 |
oct | 3064622275470 |
9 | 671367675178 |
10 | 213243231032 |
11 | 82488276737 |
12 | 353b2887708 |
13 | 17154c03560 |
14 | a46cc83a76 |
15 | 5830e1e872 |
hex | 31a6497b38 |
213243231032 has 64 divisors (see below), whose sum is σ = 431770197600. Its totient is φ = 98150008320.
The previous prime is 213243230989. The next prime is 213243231059. The reversal of 213243231032 is 230132342312.
It is a happy number.
213243231032 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 (26).
It is a junction number, because it is equal to n+sod(n) for n = 213243230992 and 213243231010.
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 15 ways as a sum of consecutive naturals, for example, 78081107 + ... + 78083837.
Almost surely, 2213243231032 is an apocalyptic number.
It is an amenable number.
213243231032 is an abundant number, since it is smaller than the sum of its proper divisors (218526966568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213243231032 is a wasteful number, since it uses less digits than its factorization.
213243231032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4536 (or 4532 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 213243231032 its reverse (230132342312), we get a palindrome (443375573344).
The spelling of 213243231032 in words is "two hundred thirteen billion, two hundred forty-three million, two hundred thirty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •