Base | Representation |
---|---|
bin | 11010100000000100111010… |
… | …100111111100001101010110 |
3 | 120021200101222120210120011102 |
4 | 122200010322213330031112 |
5 | 110234103042312412220 |
6 | 1051515535505510102 |
7 | 33356466441436532 |
oct | 3240047247741526 |
9 | 507611876716142 |
10 | 116553511060310 |
11 | 341570804a4725 |
12 | 110a4a27042332 |
13 | 5005c44a5b6cc |
14 | 20ad311ac0bc2 |
15 | d71c57017775 |
hex | 6a013a9fc356 |
116553511060310 has 32 divisors (see below), whose sum is σ = 211533344225280. Its totient is φ = 46236670870752.
The previous prime is 116553511060307. The next prime is 116553511060447. The reversal of 116553511060310 is 13060115355611.
116553511060310 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1165535110603102 (a number of 29 digits) contains 22 as substring.
It is a congruent 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 15 ways as a sum of consecutive naturals, for example, 78757214 + ... + 80223473.
It is an arithmetic number, because the mean of its divisors is an integer number (6610417007040).
Almost surely, 2116553511060310 is an apocalyptic number.
116553511060310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
116553511060310 is a deficient number, since it is larger than the sum of its proper divisors (94979833164970).
116553511060310 is a wasteful number, since it uses less digits than its factorization.
116553511060310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158981300.
The product of its (nonzero) digits is 40500, while the sum is 38.
The spelling of 116553511060310 in words is "one hundred sixteen trillion, five hundred fifty-three billion, five hundred eleven million, sixty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •