Base | Representation |
---|---|
bin | 111101011001101… |
… | …111010101110001 |
3 | 2122210102102200012 |
4 | 331121233111301 |
5 | 4102210021211 |
6 | 250115504305 |
7 | 34346124110 |
oct | 7531572561 |
9 | 2583372605 |
10 | 1030157681 |
11 | 489551793 |
12 | 248bb8095 |
13 | 135568b77 |
14 | 9ab5bc77 |
15 | 6068bd8b |
hex | 3d66f571 |
1030157681 has 8 divisors (see below), whose sum is σ = 1188980544. Its totient is φ = 874249200.
The previous prime is 1030157651. The next prime is 1030157701. The reversal of 1030157681 is 1867510301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1030157681 - 26 = 1030157617 is a prime.
It is a super-2 number, since 2×10301576812 = 2122449695446595522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1030157651) by changing a digit.
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, 727835 + ... + 729248.
It is an arithmetic number, because the mean of its divisors is an integer number (148622568).
Almost surely, 21030157681 is an apocalyptic number.
It is an amenable number.
1030157681 is a deficient number, since it is larger than the sum of its proper divisors (158822863).
1030157681 is a wasteful number, since it uses less digits than its factorization.
1030157681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1457191.
The product of its (nonzero) digits is 5040, while the sum is 32.
The square root of 1030157681 is about 32096.0695568788. The cubic root of 1030157681 is about 1009.9531661452.
Adding to 1030157681 its reverse (1867510301), we get a palindrome (2897667982).
The spelling of 1030157681 in words is "one billion, thirty million, one hundred fifty-seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •