Base | Representation |
---|---|
bin | 111100100000001… |
… | …1000101011010101 |
3 | 12020111002000022102 |
4 | 1321000120223111 |
5 | 13124204103323 |
6 | 533241011445 |
7 | 101210640536 |
oct | 17100305325 |
9 | 5214060272 |
10 | 2030144213 |
11 | 951a66439 |
12 | 487a83b85 |
13 | 26479cb86 |
14 | 1538a468d |
15 | bd369328 |
hex | 79018ad5 |
2030144213 has 6 divisors (see below), whose sum is σ = 2097746262. Its totient is φ = 1964654760.
The previous prime is 2030144189. The next prime is 2030144257. The reversal of 2030144213 is 3124410302.
It can be written as a sum of positive squares in only one way, i.e., 1379231044 + 650913169 = 37138^2 + 25513^2 .
It is not a de Polignac number, because 2030144213 - 28 = 2030143957 is a prime.
It is a super-3 number, since 3×20301442133 (a number of 29 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2030144513) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1055306 + ... + 1057227.
It is an arithmetic number, because the mean of its divisors is an integer number (349624377).
Almost surely, 22030144213 is an apocalyptic number.
It is an amenable number.
2030144213 is a deficient number, since it is larger than the sum of its proper divisors (67602049).
2030144213 is an equidigital number, since it uses as much as digits as its factorization.
2030144213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2112595 (or 2112564 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 2030144213 is about 45057.1216679450. The cubic root of 2030144213 is about 1266.2194000350.
Adding to 2030144213 its reverse (3124410302), we get a palindrome (5154554515).
The spelling of 2030144213 in words is "two billion, thirty million, one hundred forty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •