Base | Representation |
---|---|
bin | 110000011011111111101010… |
… | …110110101100100101010000 |
3 | 1000221021110201120221011120221 |
4 | 300123333222312230211100 |
5 | 210410240441404334412 |
6 | 2033024350325442424 |
7 | 62604624364364002 |
oct | 6033775266544520 |
9 | 1027243646834527 |
10 | 213030023121232 |
11 | 61972586409429 |
12 | 1ba8678b870414 |
13 | 91b3850046395 |
14 | 3a869cb192372 |
15 | 19965ee3bab07 |
hex | c1bfeadac950 |
213030023121232 has 20 divisors (see below), whose sum is σ = 412745912069920. Its totient is φ = 106514949038688.
The previous prime is 213030023121193. The next prime is 213030023121239. The reversal of 213030023121232 is 232121320030312.
It is a super-2 number, since 2×2130300231212322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 213030023121197 and 213030023121206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213030023121239) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 37496869 + ... + 42802747.
It is an arithmetic number, because the mean of its divisors is an integer number (20637295603496).
Almost surely, 2213030023121232 is an apocalyptic number.
It is an amenable number.
213030023121232 is a deficient number, since it is larger than the sum of its proper divisors (199715888948688).
213030023121232 is a wasteful number, since it uses less digits than its factorization.
213030023121232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7815250 (or 7815244 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 213030023121232 its reverse (232121320030312), we get a palindrome (445151343151544).
The spelling of 213030023121232 in words is "two hundred thirteen trillion, thirty billion, twenty-three million, one hundred twenty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •