Base | Representation |
---|---|
bin | 1001110000100100110011… |
… | …1010101110111110100100 |
3 | 1101222210022102111201120101 |
4 | 2130021030322232332210 |
5 | 2401300240401124341 |
6 | 34453203140113444 |
7 | 2155140226450531 |
oct | 234111472567644 |
9 | 41883272451511 |
10 | 10730118770596 |
11 | 3467688348865 |
12 | 125369b095884 |
13 | 5caacc4739c4 |
14 | 2914aa557d88 |
15 | 1391ad285831 |
hex | 9c24ceaefa4 |
10730118770596 has 27 divisors (see below), whose sum is σ = 18832474075233. Its totient is φ = 5349457292880.
The previous prime is 10730118770549. The next prime is 10730118770659. The reversal of 10730118770596 is 69507781103701.
It is a happy number.
The square root of 10730118770596 is 3275686.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 5832466502500 + 4897652268096 = 2415050^2 + 2213064^2 .
It is a super-2 number, since 2×107301187705962 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
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 8 ways as a sum of consecutive naturals, for example, 2443659561 + ... + 2443663951.
Almost surely, 210730118770596 is an apocalyptic number.
10730118770596 is the 3275686-th square number.
It is an amenable number.
10730118770596 is a deficient number, since it is larger than the sum of its proper divisors (8102355304637).
10730118770596 is an frugal number, since it uses more digits than its factorization.
10730118770596 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9532 (or 4766 counting only the distinct ones).
The product of its (nonzero) digits is 2222640, while the sum is 55.
The spelling of 10730118770596 in words is "ten trillion, seven hundred thirty billion, one hundred eighteen million, seven hundred seventy thousand, five hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •