Base | Representation |
---|---|
bin | 111101011110101… |
… | …011110110100001 |
3 | 2122212212022001012 |
4 | 331132223312201 |
5 | 4103023012423 |
6 | 250203350305 |
7 | 34363133564 |
oct | 7536536641 |
9 | 2585768035 |
10 | 1031454113 |
11 | 48a257818 |
12 | 249522395 |
13 | 135900ca1 |
14 | 9adb84db |
15 | 60846078 |
hex | 3d7abda1 |
1031454113 has 8 divisors (see below), whose sum is σ = 1076684928. Its totient is φ = 986255424.
The previous prime is 1031454101. The next prime is 1031454161. The reversal of 1031454113 is 3114541301.
It is a happy number.
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 1031454113 - 216 = 1031388577 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1031454013) 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, 76745 + ... + 89177.
It is an arithmetic number, because the mean of its divisors is an integer number (134585616).
Almost surely, 21031454113 is an apocalyptic number.
It is an amenable number.
1031454113 is a deficient number, since it is larger than the sum of its proper divisors (45230815).
1031454113 is a wasteful number, since it uses less digits than its factorization.
1031454113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16063.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 1031454113 is about 32116.2593245228. The cubic root of 1031454113 is about 1010.3766568896.
Adding to 1031454113 its reverse (3114541301), we get a palindrome (4145995414).
The spelling of 1031454113 in words is "one billion, thirty-one million, four hundred fifty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •