Base | Representation |
---|---|
bin | 11101111110110001001… |
… | …01111100101010111001 |
3 | 10122110221121020100010000 |
4 | 32333120211330222321 |
5 | 113334202014311413 |
6 | 2105122522343213 |
7 | 134265415053633 |
oct | 16773045745271 |
9 | 3573847210100 |
10 | 1030131010233 |
11 | 367970110946 |
12 | 14779095ab09 |
13 | 761aa841190 |
14 | 37c04035a53 |
15 | 1bbe1b1d073 |
hex | efd897cab9 |
1030131010233 has 80 divisors (see below), whose sum is σ = 1689277778496. Its totient is φ = 621777513600.
The previous prime is 1030131010189. The next prime is 1030131010247. The reversal of 1030131010233 is 3320101310301.
It is a happy number.
1030131010233 is a `hidden beast` number, since 10 + 301 + 310 + 10 + 2 + 33 = 666.
It is not a de Polignac number, because 1030131010233 - 26 = 1030131010169 is a prime.
It is a super-2 number, since 2×10301310102332 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1030131010033) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 11334510 + ... + 11425032.
Almost surely, 21030131010233 is an apocalyptic number.
1030131010233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1030131010233 is a deficient number, since it is larger than the sum of its proper divisors (659146768263).
1030131010233 is a wasteful number, since it uses less digits than its factorization.
1030131010233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90756 (or 90747 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 1030131010233 its reverse (3320101310301), we get a palindrome (4350232320534).
The spelling of 1030131010233 in words is "one trillion, thirty billion, one hundred thirty-one million, ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •