Base | Representation |
---|---|
bin | 11101101000011100110001… |
… | …101000011111101100001000 |
3 | 122002102202111201012212202222 |
4 | 131220130301220133230020 |
5 | 114040203023443033142 |
6 | 1141101323224313212 |
7 | 36310346026033343 |
oct | 3550346150375410 |
9 | 562382451185688 |
10 | 130323025361672 |
11 | 38585759336550 |
12 | 12749585612808 |
13 | 57945407b2950 |
14 | 242794d31145a |
15 | 10100033c6bd2 |
hex | 768731a1fb08 |
130323025361672 has 64 divisors (see below), whose sum is σ = 292491708989760. Its totient is φ = 53649272851200.
The previous prime is 130323025361671. The next prime is 130323025361687. The reversal of 130323025361672 is 276163520323031.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is not an unprimeable number, because it can be changed into a prime (130323025361671) 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, 1074644354 + ... + 1074765617.
It is an arithmetic number, because the mean of its divisors is an integer number (4570182952965).
Almost surely, 2130323025361672 is an apocalyptic number.
It is an amenable number.
130323025361672 is an abundant number, since it is smaller than the sum of its proper divisors (162168683628088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130323025361672 is a wasteful number, since it uses less digits than its factorization.
130323025361672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2149410054 (or 2149410050 counting only the distinct ones).
The product of its (nonzero) digits is 816480, while the sum is 44.
The spelling of 130323025361672 in words is "one hundred thirty trillion, three hundred twenty-three billion, twenty-five million, three hundred sixty-one thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •