Base | Representation |
---|---|
bin | 111100101100001110… |
… | …1011110110110101101 |
3 | 110110102010210122010220 |
4 | 1321120131132312231 |
5 | 4113410241024240 |
6 | 135512455321553 |
7 | 12262530301062 |
oct | 1713035366655 |
9 | 413363718126 |
10 | 130333142445 |
11 | 5030172aa70 |
12 | 213143802b9 |
13 | c3a0c07a3c |
14 | 6445828c69 |
15 | 35cc21c5d0 |
hex | 1e5875edad |
130333142445 has 32 divisors (see below), whose sum is σ = 229699252224. Its totient is φ = 62578305600.
The previous prime is 130333142437. The next prime is 130333142447. The reversal of 130333142445 is 544241333031.
It is not a de Polignac number, because 130333142445 - 23 = 130333142437 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130333142447) 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 31 ways as a sum of consecutive naturals, for example, 3817461 + ... + 3851450.
It is an arithmetic number, because the mean of its divisors is an integer number (7178101632).
Almost surely, 2130333142445 is an apocalyptic number.
130333142445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
130333142445 is a deficient number, since it is larger than the sum of its proper divisors (99366109779).
130333142445 is a wasteful number, since it uses less digits than its factorization.
130333142445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7669033.
The product of its (nonzero) digits is 51840, while the sum is 33.
Adding to 130333142445 its reverse (544241333031), we get a palindrome (674574475476).
The spelling of 130333142445 in words is "one hundred thirty billion, three hundred thirty-three million, one hundred forty-two thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •