Base | Representation |
---|---|
bin | 11101111110110000001… |
… | …11011100010000001101 |
3 | 10122110221001012001011010 |
4 | 32333120013130100031 |
5 | 113334142442410013 |
6 | 2105122035115433 |
7 | 134265260065524 |
oct | 16773007342015 |
9 | 3573831161133 |
10 | 1030123013133 |
11 | 367966649575 |
12 | 14778a142b79 |
13 | 761a8ca1176 |
14 | 37c02d534bb |
15 | 1bbe108d7c3 |
hex | efd81dc40d |
1030123013133 has 8 divisors (see below), whose sum is σ = 1396776967200. Its totient is φ = 675108867248.
The previous prime is 1030123013123. The next prime is 1030123013141. The reversal of 1030123013133 is 3313103210301.
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 1030123013133 - 210 = 1030123012109 is a prime.
It is a super-2 number, since 2×10301230131332 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030123013123) 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, 2909951838 + ... + 2909952191.
It is an arithmetic number, because the mean of its divisors is an integer number (174597120900).
Almost surely, 21030123013133 is an apocalyptic number.
It is an amenable number.
1030123013133 is a deficient number, since it is larger than the sum of its proper divisors (366653954067).
1030123013133 is an equidigital number, since it uses as much as digits as its factorization.
1030123013133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5819904091.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1030123013133 its reverse (3313103210301), we get a palindrome (4343226223434).
The spelling of 1030123013133 in words is "one trillion, thirty billion, one hundred twenty-three million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •