Base | Representation |
---|---|
bin | 11101101000101001010111… |
… | …110110110000001101010110 |
3 | 122002111001102101002200222000 |
4 | 131220221113312300031112 |
5 | 114040413224143113241 |
6 | 1141111441333220130 |
7 | 36311335151436324 |
oct | 3550512766601526 |
9 | 562431371080860 |
10 | 130336551535446 |
11 | 3859046a525063 |
12 | 1275011b491646 |
13 | 57958b7ba1c79 |
14 | 24284738c6d14 |
15 | 1010545b11eb6 |
hex | 768a57db0356 |
130336551535446 has 64 divisors (see below), whose sum is σ = 297467131637760. Its totient is φ = 42270983002080.
The previous prime is 130336551535319. The next prime is 130336551535457. The reversal of 130336551535446 is 644535155633031.
130336551535446 is a `hidden beast` number, since 1 + 3 + 0 + 3 + 3 + 65 + 5 + 1 + 535 + 4 + 46 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 130336551535392 and 130336551535401.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 509184225 + ... + 509440131.
It is an arithmetic number, because the mean of its divisors is an integer number (4647923931840).
Almost surely, 2130336551535446 is an apocalyptic number.
130336551535446 is an abundant number, since it is smaller than the sum of its proper divisors (167130580102314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130336551535446 is a wasteful number, since it uses less digits than its factorization.
130336551535446 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510866 (or 510860 counting only the distinct ones).
The product of its (nonzero) digits is 29160000, while the sum is 54.
The spelling of 130336551535446 in words is "one hundred thirty trillion, three hundred thirty-six billion, five hundred fifty-one million, five hundred thirty-five thousand, four hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •