Base | Representation |
---|---|
bin | 11101101110111010011010… |
… | …011101000101110100100000 |
3 | 122011000012220121110021000221 |
4 | 131232322122131011310200 |
5 | 114114442123344030141 |
6 | 1142041335003252424 |
7 | 36354421160621644 |
oct | 3556723235056440 |
9 | 564005817407027 |
10 | 130767165611296 |
11 | 38737052992795 |
12 | 127bb67721a114 |
13 | 57c73a1b8ba96 |
14 | 24412438a2c24 |
15 | 101b849ed2bd1 |
hex | 76ee9a745d20 |
130767165611296 has 24 divisors (see below), whose sum is σ = 257489766825984. Its totient is φ = 65372939115840.
The previous prime is 130767165611287. The next prime is 130767165611321. The reversal of 130767165611296 is 692116561767031.
It is a happy number.
It is a Smith number, since the sum of its digits (61) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 332415660 + ... + 332808811.
It is an arithmetic number, because the mean of its divisors is an integer number (10728740284416).
Almost surely, 2130767165611296 is an apocalyptic number.
130767165611296 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
130767165611296 is a deficient number, since it is larger than the sum of its proper divisors (126722601214688).
130767165611296 is an equidigital number, since it uses as much as digits as its factorization.
130767165611296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 665230624 (or 665230616 counting only the distinct ones).
The product of its (nonzero) digits is 17146080, while the sum is 61.
The spelling of 130767165611296 in words is "one hundred thirty trillion, seven hundred sixty-seven billion, one hundred sixty-five million, six hundred eleven thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •