Base | Representation |
---|---|
bin | 11101101101111110111001… |
… | …100111101000101111000000 |
3 | 122010210002222012020000220011 |
4 | 131231332321213220233000 |
5 | 114112420241033210000 |
6 | 1141552130041154304 |
7 | 36346666503554404 |
oct | 3555767147505700 |
9 | 563702865200804 |
10 | 130703263960000 |
11 | 38711a41095326 |
12 | 127ab20278b994 |
13 | 57c1359cc61b4 |
14 | 243c100b7b104 |
15 | 1019d59e852ba |
hex | 76dfb99e8bc0 |
130703263960000 has 280 divisors, whose sum is σ = 334195705754064. Its totient is φ = 50676787200000.
The previous prime is 130703263959977. The next prime is 130703263960019. The reversal of 130703263960000 is 69362307031.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 175588600 + ... + 176331400.
Almost surely, 2130703263960000 is an apocalyptic number.
130703263960000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130703263960000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167097852877032).
130703263960000 is an abundant number, since it is smaller than the sum of its proper divisors (203492441794064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130703263960000 is an frugal number, since it uses more digits than its factorization.
130703263960000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 742969 (or 742944 counting only the distinct ones).
The product of its (nonzero) digits is 122472, while the sum is 40.
The spelling of 130703263960000 in words is "one hundred thirty trillion, seven hundred three billion, two hundred sixty-three million, nine hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •