Base | Representation |
---|---|
bin | 1100010011101101101… |
… | …1000000011111001010 |
3 | 202012210100002212122122 |
4 | 3010323123000133022 |
5 | 11431022241130010 |
6 | 241050002251242 |
7 | 21163636114301 |
oct | 3047333003712 |
9 | 665710085578 |
10 | 211450333130 |
11 | 81748222a33 |
12 | 34b92356b22 |
13 | 16c2a62c01a |
14 | a33cad9438 |
15 | 577881a855 |
hex | 313b6c07ca |
211450333130 has 16 divisors (see below), whose sum is σ = 402999458760. Its totient is φ = 79604831232.
The previous prime is 211450333099. The next prime is 211450333141. The reversal of 211450333130 is 31333054112.
211450333130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 137812455361 + 73637877769 = 371231^2 + 271363^2 .
It is a super-2 number, since 2×2114503331302 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 211450333130.
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 7 ways as a sum of consecutive naturals, for example, 621912575 + ... + 621912914.
Almost surely, 2211450333130 is an apocalyptic number.
211450333130 is a deficient number, since it is larger than the sum of its proper divisors (191549125630).
211450333130 is a wasteful number, since it uses less digits than its factorization.
211450333130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1243825513.
The product of its (nonzero) digits is 3240, while the sum is 26.
Adding to 211450333130 its reverse (31333054112), we get a palindrome (242783387242).
The spelling of 211450333130 in words is "two hundred eleven billion, four hundred fifty million, three hundred thirty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •