Base | Representation |
---|---|
bin | 11101111110110010011… |
… | …00111100001110011111 |
3 | 10122110222022110122210010 |
4 | 32333121030330032133 |
5 | 113334212123411111 |
6 | 2105123525414303 |
7 | 134265600666042 |
oct | 16773114741637 |
9 | 3573868418703 |
10 | 1030141232031 |
11 | 36797596270a |
12 | 14779426a393 |
13 | 761ac9ac992 |
14 | 37c05536c59 |
15 | 1bbe298baa6 |
hex | efd933c39f |
1030141232031 has 8 divisors (see below), whose sum is σ = 1373569700400. Its totient is φ = 686736792512.
The previous prime is 1030141231981. The next prime is 1030141232047. The reversal of 1030141232031 is 1302321410301.
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 1030141232031 - 26 = 1030141231967 is a prime.
It is a super-2 number, since 2×10301412320312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030141231989 and 1030141232007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030141232531) 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, 5906940 + ... + 6078833.
It is an arithmetic number, because the mean of its divisors is an integer number (171696212550).
Almost surely, 21030141232031 is an apocalyptic number.
1030141232031 is a deficient number, since it is larger than the sum of its proper divisors (343428468369).
1030141232031 is a wasteful number, since it uses less digits than its factorization.
1030141232031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12014425.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1030141232031 its reverse (1302321410301), we get a palindrome (2332462642332).
The spelling of 1030141232031 in words is "one trillion, thirty billion, one hundred forty-one million, two hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •