Base | Representation |
---|---|
bin | 111101001000100… |
… | …100110101100101 |
3 | 2122110221211120020 |
4 | 331020210311211 |
5 | 4100032030323 |
6 | 245435225353 |
7 | 34262644116 |
oct | 7510446545 |
9 | 2573854506 |
10 | 1025658213 |
11 | 486a59218 |
12 | 2475a8259 |
13 | 134651b68 |
14 | 9a30a20d |
15 | 6009dae3 |
hex | 3d224d65 |
1025658213 has 8 divisors (see below), whose sum is σ = 1368492576. Its totient is φ = 683298000.
The previous prime is 1025658191. The next prime is 1025658233. The reversal of 1025658213 is 3128565201.
1025658213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1025658213 - 29 = 1025657701 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1025658233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 113458 + ... + 122163.
It is an arithmetic number, because the mean of its divisors is an integer number (171061572).
Almost surely, 21025658213 is an apocalyptic number.
It is an amenable number.
1025658213 is a deficient number, since it is larger than the sum of its proper divisors (342834363).
1025658213 is a wasteful number, since it uses less digits than its factorization.
1025658213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237075.
The product of its (nonzero) digits is 14400, while the sum is 33.
The square root of 1025658213 is about 32025.8990974492. The cubic root of 1025658213 is about 1008.4806135496.
The spelling of 1025658213 in words is "one billion, twenty-five million, six hundred fifty-eight thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •