Base | Representation |
---|---|
bin | 11101100011111001011001… |
… | …110001001000010101101000 |
3 | 122001022211222000022202010010 |
4 | 131203321121301020111220 |
5 | 114020041310010220402 |
6 | 1140301502404451520 |
7 | 36245632054144065 |
oct | 3543713161102550 |
9 | 561284860282103 |
10 | 130010166101352 |
11 | 38475002451689 |
12 | 126b8a116a9ba0 |
13 | 5770ba17bb284 |
14 | 24167503dbc6c |
15 | 1006ce1d16a6c |
hex | 763e59c48568 |
130010166101352 has 32 divisors (see below), whose sum is σ = 325035514591200. Its totient is φ = 43335375455424.
The previous prime is 130010166101251. The next prime is 130010166101461. The reversal of 130010166101352 is 253101661010031.
It is a super-2 number, since 2×1300101661013522 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 83372518 + ... + 84917589.
It is an arithmetic number, because the mean of its divisors is an integer number (10157359830975).
Almost surely, 2130010166101352 is an apocalyptic number.
130010166101352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130010166101352 is an abundant number, since it is smaller than the sum of its proper divisors (195025348489848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130010166101352 is a wasteful number, since it uses less digits than its factorization.
130010166101352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168322305 (or 168322301 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 30.
The spelling of 130010166101352 in words is "one hundred thirty trillion, ten billion, one hundred sixty-six million, one hundred one thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •