Base | Representation |
---|---|
bin | 111101000110100… |
… | …011111011100101 |
3 | 2122102222000021200 |
4 | 331012203323211 |
5 | 4044413131323 |
6 | 245420033113 |
7 | 34255314552 |
oct | 7506437345 |
9 | 2572860250 |
10 | 1025130213 |
11 | 486728558 |
12 | 247392799 |
13 | 1344c8733 |
14 | 9a20da29 |
15 | 5eee7443 |
hex | 3d1a3ee5 |
1025130213 has 12 divisors (see below), whose sum is σ = 1497382380. Its totient is φ = 675740736.
The previous prime is 1025130181. The next prime is 1025130247. The reversal of 1025130213 is 3120315201.
It can be written as a sum of positive squares in 2 ways, for example, as 246552804 + 778577409 = 15702^2 + 27903^2 .
It is not a de Polignac number, because 1025130213 - 25 = 1025130181 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1025130283) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 639106 + ... + 640707.
It is an arithmetic number, because the mean of its divisors is an integer number (124781865).
Almost surely, 21025130213 is an apocalyptic number.
It is an amenable number.
1025130213 is a deficient number, since it is larger than the sum of its proper divisors (472252167).
1025130213 is a wasteful number, since it uses less digits than its factorization.
1025130213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1279908 (or 1279905 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 1025130213 is about 32017.6547079888. The cubic root of 1025130213 is about 1008.3075314725.
Adding to 1025130213 its reverse (3120315201), we get a palindrome (4145445414).
It can be divided in two parts, 102 and 5130213, that added together give a palindrome (5130315).
The spelling of 1025130213 in words is "one billion, twenty-five million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •