Base | Representation |
---|---|
bin | 111101011001111… |
… | …100001001011101 |
3 | 2122210112002122011 |
4 | 331121330021131 |
5 | 4102213211031 |
6 | 250120551221 |
7 | 34346433052 |
oct | 7531741135 |
9 | 2583462564 |
10 | 1030210141 |
11 | 489588144 |
12 | 249022511 |
13 | 1355869cc |
14 | 9ab73029 |
15 | 6069c6b1 |
hex | 3d67c25d |
1030210141 has 4 divisors (see below), whose sum is σ = 1036379232. Its totient is φ = 1024041052.
The previous prime is 1030210133. The next prime is 1030210147. The reversal of 1030210141 is 1410120301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1030210141 - 23 = 1030210133 is a prime.
It is a super-2 number, since 2×10302101412 = 2122665869238479762, which contains 22 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 (1030210147) 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, 3084295 + ... + 3084628.
It is an arithmetic number, because the mean of its divisors is an integer number (259094808).
Almost surely, 21030210141 is an apocalyptic number.
It is an amenable number.
1030210141 is a deficient number, since it is larger than the sum of its proper divisors (6169091).
1030210141 is an equidigital number, since it uses as much as digits as its factorization.
1030210141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6169090.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1030210141 is about 32096.8867804963. The cubic root of 1030210141 is about 1009.9703095543.
Adding to 1030210141 its reverse (1410120301), we get a palindrome (2440330442).
The spelling of 1030210141 in words is "one billion, thirty million, two hundred ten thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •