Base | Representation |
---|---|
bin | 11101111110110001000… |
… | …11010100101011010101 |
3 | 10122110221112221101012211 |
4 | 32333120203110223111 |
5 | 113334201330302013 |
6 | 2105122455513421 |
7 | 134265406156543 |
oct | 16773043245325 |
9 | 3573845841184 |
10 | 1030130322133 |
11 | 36796a790970 |
12 | 147790688871 |
13 | 761aa65cc13 |
14 | 37c03cd6d93 |
15 | 1bbe1a3423d |
hex | efd88d4ad5 |
1030130322133 has 16 divisors (see below), whose sum is σ = 1142650607616. Its totient is φ = 920885898240.
The previous prime is 1030130322097. The next prime is 1030130322139. The reversal of 1030130322133 is 3312230310301.
It is not a de Polignac number, because 1030130322133 - 217 = 1030130191061 is a prime.
It is a super-2 number, since 2×10301303221332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030130322139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3104916 + ... + 3420637.
It is an arithmetic number, because the mean of its divisors is an integer number (71415662976).
Almost surely, 21030130322133 is an apocalyptic number.
It is an amenable number.
1030130322133 is a deficient number, since it is larger than the sum of its proper divisors (112520285483).
1030130322133 is a wasteful number, since it uses less digits than its factorization.
1030130322133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6525804.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 1030130322133 its reverse (3312230310301), we get a palindrome (4342360632434).
The spelling of 1030130322133 in words is "one trillion, thirty billion, one hundred thirty million, three hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •