Base | Representation |
---|---|
bin | 11101100110111110000010… |
… | …011000110110101110101101 |
3 | 122002002000221100212221120010 |
4 | 131212332002120312232231 |
5 | 114032021211024014013 |
6 | 1140542501222243433 |
7 | 36300115143162546 |
oct | 3546760230665655 |
9 | 562060840787503 |
10 | 130221301001133 |
11 | 385465a86098a1 |
12 | 12731916286579 |
13 | 5787a7b977834 |
14 | 2422a5d2674cd |
15 | 100c54cac57c3 |
hex | 766f82636bad |
130221301001133 has 8 divisors (see below), whose sum is σ = 173628807395200. Its totient is φ = 86813997637248.
The previous prime is 130221301001131. The next prime is 130221301001137. The reversal of 130221301001133 is 331100103122031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130221301001133 - 21 = 130221301001131 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130221301001131) 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, 49254613 + ... + 51831066.
It is an arithmetic number, because the mean of its divisors is an integer number (21703600924400).
Almost surely, 2130221301001133 is an apocalyptic number.
It is an amenable number.
130221301001133 is a deficient number, since it is larger than the sum of its proper divisors (43407506394067).
130221301001133 is a wasteful number, since it uses less digits than its factorization.
130221301001133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101515091.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 130221301001133 its reverse (331100103122031), we get a palindrome (461321404123164).
The spelling of 130221301001133 in words is "one hundred thirty trillion, two hundred twenty-one billion, three hundred one million, one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •