Base | Representation |
---|---|
bin | 111101011001100… |
… | …100101100000011 |
3 | 2122210100012211021 |
4 | 331121210230003 |
5 | 4102202122201 |
6 | 250114530311 |
7 | 34345552651 |
oct | 7531445403 |
9 | 2583305737 |
10 | 1030114051 |
11 | 489521a2a |
12 | 248b96997 |
13 | 135552055 |
14 | 9ab49dd1 |
15 | 6067dea1 |
hex | 3d664b03 |
1030114051 has 4 divisors (see below), whose sum is σ = 1084330600. Its totient is φ = 975897504.
The previous prime is 1030114039. The next prime is 1030114067. The reversal of 1030114051 is 1504110301.
1030114051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1030114051 - 217 = 1029982979 is a prime.
It is a super-2 number, since 2×10301140512 = 2122269916135261202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1030114081) 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, 27108246 + ... + 27108283.
It is an arithmetic number, because the mean of its divisors is an integer number (271082650).
Almost surely, 21030114051 is an apocalyptic number.
1030114051 is a deficient number, since it is larger than the sum of its proper divisors (54216549).
1030114051 is an equidigital number, since it uses as much as digits as its factorization.
1030114051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54216548.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 1030114051 is about 32095.3898714442. The cubic root of 1030114051 is about 1009.9389078494.
Adding to 1030114051 its reverse (1504110301), we get a palindrome (2534224352).
The spelling of 1030114051 in words is "one billion, thirty million, one hundred fourteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •