Base | Representation |
---|---|
bin | 11101101000100011101011… |
… | …001000010000111111010001 |
3 | 122002110110121220221120020022 |
4 | 131220203223020100333101 |
5 | 114040313211201123241 |
6 | 1141104550223553225 |
7 | 36311030420134556 |
oct | 3550435310207721 |
9 | 562413556846208 |
10 | 130330432442321 |
11 | 3858890a451901 |
12 | 1274aab215b815 |
13 | 5795151238cc7 |
14 | 2428052d56a2d |
15 | 10102d880254b |
hex | 7688eb210fd1 |
130330432442321 has 16 divisors (see below), whose sum is σ = 130983372843840. Its totient is φ = 129678237472320.
The previous prime is 130330432442317. The next prime is 130330432442341. The reversal of 130330432442321 is 123244234033031.
It is a cyclic number.
It is not a de Polignac number, because 130330432442321 - 22 = 130330432442317 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130330432442341) 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, 7310836010 + ... + 7310853836.
It is an arithmetic number, because the mean of its divisors is an integer number (8186460802740).
Almost surely, 2130330432442321 is an apocalyptic number.
It is an amenable number.
130330432442321 is a deficient number, since it is larger than the sum of its proper divisors (652940401519).
130330432442321 is a wasteful number, since it uses less digits than its factorization.
130330432442321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36704.
The product of its (nonzero) digits is 124416, while the sum is 35.
Adding to 130330432442321 its reverse (123244234033031), we get a palindrome (253574666475352).
The spelling of 130330432442321 in words is "one hundred thirty trillion, three hundred thirty billion, four hundred thirty-two million, four hundred forty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •